1040 Longest Symmetric String (25分)——C语言实现(动态规划)

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，表示str[i] 到str[j]是回文序列。
递推方程为：

1 当s[i] == s[j] : dp[i][j] = dp[i+1][j-1]

2 当s[i] != s[j] : dp[i][j] =0

3 边界：初始化 dp[i][i] = 1, dp[i][i+1] = (s[i] == s[i+1]) ? 1 : 0

因为i、j如果从小到大的顺序来枚举的话，无法保证更新dp[i][j]的时候dp[i+1][j-1]已经被计算过。因此不妨考虑按照字串的长度和子串的初试位置进行枚举，即第一遍将长度为3的子串的dp的值全部求出，第二遍通过第一遍结果计算出长度为4的子串的dp的值…这样就可以避免状态无法转移的问题

首先初始化dp[i][i] = 1, dp[i][i+1]，把长度为1和2的都初始化好，然后从L = 3开始一直到 L <= len 根据动态规划的递归方程来判断。
（我对动态规划还不是太明白，本题参考柳神的文章)https://blog.csdn.net/liuchuo/article/details/52138902

代码：

#include<stdio.h>
#include<string.h>

int dp[1010][1010] = {0};

int main(){
	int i, j;
	int count = 1, max = 0;
	char str[1010];
	gets(str);
	int len = strlen(str);
	for(i = 0; i < len; i++){
		dp[i][i] = 1;
		if(i < len - 1 && str[i] == str[i+1]){
			dp[i][i+1] = 1;
			count = 2;
		}
	}
	//该部分对字符串
	for(int L = 3; L <= len; L++) {
        for(i = 0; i + L - 1 < len; i++) {
            j = i + L -1;
            if(str[i] == str[j] && dp[i+1][j-1] == 1) {
                dp[i][j] = 1;
                count = L;
            }
        }
    }
	printf("%d", count);
	return 0;
}