Woo的专栏

Description There are two machines A and B. There are n tasks, namely task 1, task 2, ..., task n. You must assign each task to one machine to process it. There are some facts you must know and com

题意： 把一个字符串分割成多个小串，小串组成严格递增序列，n   这是一个DP。 s代表原串 dp[i][j]代表当前到i位置最后一个串是以j为开头的方案数。答案就是dp[n][1]+...+dp[n][n] 很容易得到dp[i][j]=dp[j-1][k]+dp[j-1][k+1]……dp[j-1][j-1]    （i-j=j-k） 如果s[k-1....j-1] >=s[j...

过河卒 Time Limit: 5000 MS Memory Limit: 65536 K Total Submit: 152(35 users) Total Accepted: 33(21 users) Rating: Special Judge: No Description Lda学会了中国