Find number of unique longest increasing subsequence in array a.
Constraints : 1 <= Lenght of a <= 5000, 0 < a[i] < 2^31
Example input :
4
1 2 2 3
Example output :
1
Help me :v.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Number of unique longest increasing subsequence
Find number of unique longest increasing subsequence in array a.
Constraints : 1 <= Lenght of a <= 5000, 0 < a[i] < 2^31
Example input :
4
1 2 2 3
Example output :
1
Help me :v.
Name |
---|