摘要：
题意：把字符串划分成尽量少的回文串。dp[i] = max{dp[j-1] + 1 | str[j....i]为回文串}。View Code 1 /* 2 Author:Zhaofa Fang 3 Lang:C++ 4 */ 5 #include <cstdio> 6 #include <cstdlib> 7 #include <sstream> 8 #include <iostream> 9 #include <cmath>10 #include <cstring>11 #include <algorithm> 阅读全文
