![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
dp+acm
binggo1226
这个作者很懒,什么都没留下…
展开
-
hdu4939(动态规划)
/* Stupid Tower Defense Time Limit: 12000/6000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 2187 Accepted Submission(s): 603 Problem Description FSF is addict转载 2017-03-05 14:14:41 · 213 阅读 · 0 评论 -
通过最长公共子串求得使得一个串变为回文串的最少添加字符
#include<iostream> #include<string> #include<cstring> #include<algorithm> using namespace std; const int maxn = 1007; int dp[2][maxn]; int main() { string s; cin >> s; int len = s.length();原创 2017-03-16 09:38:56 · 241 阅读 · 0 评论