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
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 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
There's an array (let's call it $$$d$$$) used in the standard algorithm for finding the longest increasing subsequence. We are interested in its first five elements. Recall that the input is a permutation. We see that $$$\mathit{choose} (40, 5) = 658\,008$$$. So perhaps we can devise a dynamic programming solution. The state can be the first five numbers of the array $$$d$$$.