摘要：
题目链接 "luogu P1026 统计单词个数" 题解 贪心的预处理母本串从i到j的最大单词数 然后dp[i][j] 表示从前i个切了k次最优解 转移显然 代码 c++ include include include const int maxn = 507; char a[maxn]; char 阅读全文
摘要：
打了FFT 感觉以后多项式不虚了 ~滑稽~ PS 关于详见没写完.... code c++ include include include include // pi = 3.14; inline int read() { int x = 0,f = 1 ; char c = getchar(); 阅读全文