//#if 0
#include <map>
#include <stack>
#include <queue>
#include <vector>
#include <math.h>
#include <string>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <algorithm>
#include <time.h>
#include <set>
#include <list>
#include <iostream>
using namespace std;
#define ll long long
#define ull unsigned long long
#define cls(x) memset(x,0,sizeof(x))
#define clslow(x) memset(x,-1,sizeof(x))
#define INF 0x3f3f3f3f
const int maxn=1e3+50;
int dp[maxn][maxn];
char a[maxn];
int main()
{
// freopen("in1.txt","r",stdin);
// freopen("out.txt","w",stdout);
cin.getline(a,1001);
int len=strlen(a),ans=1;
for(int i=0;i<len-1;i++){
dp[i][i]=1;
if(a[i+1]==a[i])
dp[i][i+1]=1,
ans=2;
}
for(int k=3;k<=len;k++){
for(int i=0;i+k-1<len;i++){
int j=i+k-1;
if(a[i]==a[j] && dp[i+1][j-1]==1){
dp[i][j]=1;
ans=k;
}
}
}
cout<<ans<<endl;
return 0;
}
L2-008 最长对称子串 dp求解最长回文子串
最新推荐文章于 2023-02-20 20:07:49 发布