How to solve this problem?
find the number of permutations of length N that have longest increasing subsequence equal to K
1<=N<=40 , 1<=K<=5 problem link
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 163 |
2 | cry | 161 |
3 | maomao90 | 160 |
4 | -is-this-fft- | 159 |
5 | awoo | 158 |
6 | atcoder_official | 157 |
7 | adamant | 155 |
8 | nor | 154 |
9 | maroonrk | 152 |
10 | Dominater069 | 148 |
How to solve this problem?
find the number of permutations of length N that have longest increasing subsequence equal to K
1<=N<=40 , 1<=K<=5 problem link
Can anyone help me to solve this problem?
Given a sequence A (of length N) of positive integers and an integer k, find out how many of its sub-sequences are k-medial. where k-medial means that the median of this subsequence is k. A sub-sequence of A is any sequence {A[i], A[i+1], A[i+2] ... A[j]}, where 0 ≤ i ≤ j < N.
if you participated in national olympiads or IOI talk about your strategy
Name |
---|