#include <string.h>
#include <stdio.h>
#include <algorithm>
#include <string>
#include <iostream>
#include <vector>
using namespace std;
int dp[1100][1100];
int main()
{
string str;
getline(cin,str);
int maxn=1;
for(int i=0;i<str.length();i++)
{
dp[i][i]=1;
if(i+1<str.length()&&str[i]==str[i+1])
{
dp[i][i+1]=1;
maxn=2;
}
}
for(int L=3;L<=str.length();L++)
{
for(int i=0;i<=str.length()-L;i++)
{
char c1=str[i];
char c2=str[i+L-1];
if(c1==c2&&dp[i+1][i+L-2]==1)
{
dp[i][i+L-1]=1;
maxn=L;
}
}
}
printf("%d\n",maxn);
return 0;
}
PAT甲1040 Longest Symmetric String (25)(25 分)
最新推荐文章于 2019-08-29 09:01:22 发布