摘要：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 阅读全文

摘要：题意：把一个字符串分割成多个小串，小串组成严格递增序列，n=s[j....i]， dp[i][j]+=dp[j-1][k-1]这样dp的递推式就有了，很容易发现dp[i][j]的递推式是一个前缀和，假设我比较s[k-1....j-1]和s[j....i]是O(1) 那么就可以在n^2的复杂度里得到答... 阅读全文