MLE代码如下: #include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>usingnamespacestd;//内存超限 MLEconstshortmaxn=5000+1;intd[maxn][maxn];//d表示i到j形成回文串所需加入的字符数strings;intdp(inti,intj){if(d[i][j]>=0)returnd[i][j];if(i<j){if(s[i]==s[j]){ d...
AC代码①: #include<cstdio>#include<cstring>#include<iostream>#include #include<cmath>#include<queue>#include<stack>#include<vector>#include#include<set>#include<deque>#include<cctype>#define LL long long#define INF 0x7fffffffusing namespace std;char s[5005];char t[5005];short int dp[5005...
HDU 1159 && POJ 1458 最长公共子序列。状态转移方程见代码。 #include <iostream> #include <cstdio> #include <cstring> using namespace std; char s1[1005],s2[1005]; int dp[1005][1005]; int main() { while(scanf("%s",s1+1)!=EOF) { scanf("%s",s2+1); memset(dp,0,sizeof(dp)); ...
MLE代码如下: #include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>usingnamespacestd;//内存超限 MLEconstshortmaxn=5000+1;intd[maxn][maxn];//d表示i到j形成回文串所需加入的字符数strings;intdp(inti,intj){if(d[i][j]>=0)returnd[i][j];if(i<j){if(s[i]==s[j]){ d...