以中有足乐者...

/*This Code is Submitted by Iris for Problem 1227 at 2013-07-26 10:41:29*///HOJ 1227 Common Subsequence//dp[i][j]represents first i elems and first j elems 's LCS#include #include #include using

/*This Code is Submitted by Iris for Problem 1316 at 2013-07-26 12:19:13*/#include #include using namespace std;//这个问题用DP的话,需要考虑//dp[i][j]表示长为i,j时的最大相似度//dp[i][j] = max{dp[i-1][j-1]+cal[i][j],/