PAT甲级 A1040

PAT甲级 A1040

题目详情

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

解题思路

这道题需要求一个字符串中的最长回文串。题目中如果采用暴力搜索，时间和空间都会产生问题。因此我们可以采用动态规划进行解题，我们每次设置一个二维数组记录其区间是否为回文数，每次遍历时从小到大，对单字符，相邻字符先进行更新，而后自底向上，每次获得更大的区间是就更新区间长度
AC代码如下

#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<string>
#include<algorithm>
#include<iomanip>
#include<map>
int dp[1000][1000] = { 0 };
using namespace std;
int main() {
	for (int i = 0; i < 1000; i++) {
		dp[i][i] = 1;
	}
	string s;
	getline(cin, s);
	int max = 0;
	for (int i = 0; i < s.size(); i++) {
		for (int j = i - 1; j >= 0; j--) {
			if (j == i - 1) {
				if (s[i] == s[j]) {
					dp[i][j] = 1;
					if (i - j + 1 > max) {
						max = i - j + 1;
					}
				}
			}
			else {
				if (s[i] == s[j] && dp[i - 1][j + 1] == 1) {
					dp[i][j] = 1;
					if (i - j + 1 > max) {
						max = i - j + 1;
					}
				}
			}
		}
	}
	if (max == 0) {
		cout << 1 << '\n';
	}
	else {
		cout << max << '\n';
	}

}