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.