시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
1 초 | 1024 MB | 16 | 12 | 12 | 85.714% |
As usual, Bessie the cow is causing trouble in Farmer John's barn. FJ has $N$ ($1\leq N \leq 5000$) stacks of haybales. For each $i\in [1,N]$, the $i$th stack has $h_i$ ($1\le h_i\le 10^9$) haybales. Bessie does not want any haybales to fall, so the only operation she can perform is as follows:
How many configurations are obtainable after performing the above operation finitely many times, modulo $10^9+7$? Two configurations are considered the same if, for all $i$, the $i$th stack has the same number of haybales in both.
The first line contains $T$ ($1\le T\le 10$), the number of independent test cases, all of which must be solved to solve one input correctly.
Each test case consists of $N$, and then a sequence of $N$ heights. It is guaranteed that the sum of $N$ over all test cases does not exceed $5000$.
Please output $T$ lines, one for each test case.
7 4 2 2 2 3 4 3 3 1 2 4 5 3 4 2 6 3 3 1 1 2 2 6 1 3 3 4 1 2 6 4 1 2 3 5 4 10 1 5 6 6 6 4 2 3 2 5
4 4 5 15 9 8 19
For the first test case, the four possible configurations are:
$$(2,2,2,3), (2,2,3,2), (2,3,2,2), (3,2,2,2).$$
For the second test case, the four possible configurations are:
$$(2,3,3,1),(3,2,3,1),(3,3,2,1), (3,3,1,2).$$