4
Need Help for one dp Problem.
source link: http://codeforces.com/blog/entry/96642
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
Need Help for one dp Problem.
Hi everyone. I'm having trouble thinking about a dp problem. The problem is:t There are n students with height from 1->n and one number k(n<=2000, k<=n) You have to line up ALL students so that one person in front of the first person and can see exactly k faces. Example: 2 5 1 6 3 4 => that person can see the face of 1st, 2nd and 4th student. Your work is count how many ways to line up ALL n students. (module 1e9+7)
Test Inp: 3 2 => Output 3 (2 1 3, 1 3 2, 2 3 1)
Thanks for your help.
//Ps Sorry, I am not good at English :((
Recommend
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK