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
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 151 |
9 | maroonrk | 151 |
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
Название |
---|