1 /* 2 题意:问最少插入多少个字符使得字符串变成回文串 3 区间DP:dp[i][j]表示[l, r]的字符串要成为回文需要插入几个字符串,那么dp[l][r] = dp[l+1][r-1]; (str[l] == str[r]) 4 dp[l][r] = min (dp[l+1][r], dp[l][r-1]) + 1,然后按照状态转移递归输出路径 5 */ 6 /************************************************ 7 * Author :Running_Time 8 * Created Time :2015-8-17 14:42:57 9 * File Name :UVA_10453.cpp10 ************************************************/11 12 #include 13 #include 14 #include 15 #include 16 #include 17 #include 18 #include 19 #include 20 #include 21 #include 22 #include 23 #include 24 #include