A1040 Longest Symmetric String

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 <cstdio>
#include <iostream>
#include <cstring> 
#include <algorithm>
using namespace std;
const int maxn = 1000 + 10;
int dp[maxn][maxn];  //dp[i][j]表示s[i]至s[j]所表示的子串是否是回文子串，是则为1，不是为0 
char s[maxn];
int main()
{
	cin.getline(s, maxn);
	int len = strlen(s), ans = 1;
	memset(dp, 0, sizeof(dp));
	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] == 1){
				dp[i][j] = 1;
				ans = l;
			}
		}
	}
	printf("%d\n", ans);
	return 0;
}

 解法二：