摘要：满分做法： 这个状态是我见到过最奇怪的,$f[i][j][l][r]$表示在区间$[i,j]$中取出一些数后,剩下的数值在$[l,r]$范围内的最小代价。因为$w[i] include include include include include include using namespace s 阅读全文

摘要：满分做法： 用$dp[i][j]$表示到$i$位置分为$j$段的最大值，区间dp通常枚举断点，所以预处理$sum[i][j]$表示区间$[i,j]$的单词数。 本题还用了string类型的小技巧，推荐做一下。 cpp include include include include include i 阅读全文