pat

题目

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;
bool dp[1010][1010];
string s;
int (){
    getline(cin, s);
    int len = s.length(), ans = 1;
    for(int i = 0;i < len;i++){
        dp[i][i] = true;
 if(s[i] == s[i+1] && i < len-1){
     dp[i][i+1] = true;
      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] = true;
        ans = L;
     }
    }
    }
    printf("%d", ans);
    return 0;
}

近期文章

近期评论

标签

热门

文章归档

分类目录

功能