pat 甲级 动态规划 A1040 Longest Symmetric String (25分)最长回文子串

1040 Longest Symmetric String (25分)

Given a string, you are supposed to output the length of the longest symmetric sub-string. For example, given Is PAT&TAP symmetric?, the longest symmetric sub-string is s PAT&TAP s, hence you must output 11.

Input Specification:

Each input file contains one test case which gives a non-empty string of length no more than 1000.

Output Specification:

For each test case, simply print the maximum length in a line.

Sample Input:

Is PAT&TAP symmetric?

Sample Output:

11

#include<iostream>
using namespace std;
int dp[1010][1010];
int main()
{
    string s;
    int ans=1;
    getline(cin,s);
    int len=s.length();
    for(int i=0;i<len;i++){
        dp[i][i]=1;
        if(i<len-1&&s[i]==s[i+1]){
            dp[i][i+1]=1;
            ans=2;
        }
    }
    //状态转移方程
    for(int l=3;l<=len;l++){//枚举子串长度
        for(int i=0;i+l-1<len;i++){//枚举子串的起始端点
            int j=i+l-1;//子串右端点
            if(s[i]==s[j]&&dp[i+1][j-1]==1){
                dp[i][j]=1;
                ans=l;//更新最长回文子串长度
            }
        }
    }
    cout<<ans<<endl;
    return 0;
}