摘要:
/*DP回文字符串,添加或者删除字符使得原来的字串是回文的,并且添加删除的代价最小所谓的DP,难点在于如何找到表达状态的方式。状态出来后,转移就好弄了虽然速度不是很快*/// include file#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <cctype>#include <ctime>#include <iostream>#include <sstream>#include < 阅读全文
摘要:
/*DP需要把棋盘割成n块,n>=2 && n<=14. 稍加分析,可以得出,其实求的是平方和最小写的时候确实比较繁琐。*/// include file#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <cctype>#include <ctime>#include <iostream>#include <sstream>#include <fstream&g 阅读全文