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

---

动态规划：最长回文子串
dp[i][j]=1,即i-j为回文串。
动态规划函数如下,ans记录长度。：

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]){
                dp[i][j]=1;
                ans=l;
            }
        }
    }

---

#include<iostream>
#include<string>
using namespace std;
#define maxn 1010
int dp[maxn][maxn]={0};
int main(){
    string s;
    int ans=1;
    getline(cin,s);
    int len=s.size();
    for(int i=0;i<len;i++){
        dp[i][i]=1;
        if(i<len-1){
            if(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]){
                dp[i][j]=1;
                ans=l;
            }
        }
    }
    printf("%d\n",ans); 
    return 0;
}