Help needed in this DP problem

Revision en1, by toxic_hack, 2020-08-01 11:03:11

The problem is very simple:

Count the number of permutations of length $$$N$$$ where the maximum length of an increasing subarray is exactly $$$K$$$.

where: $$$1 \leq K \leq N \leq 200$$$.

I am stuck in this problem for days. It would be really great if someone could help me out here.


Tags #dynamic programing, ecpc2018


  Rev. Lang. By When Δ Comment
en1 English toxic_hack 2020-08-01 11:03:11 368 Initial revision (published)