A1040 Longest Symmetric String （25 分）注意fgets

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
char str[1010];
int dp[1010][1010] = { 0 };
int main()
{
	fgets(str, 1010, stdin);
	int len=strlen(str);
	int ans = 1;
	if (str[len - 1] == '\n') str[len - 1] = '\0';//注意以后写fgets函数时候加上这个，以防万一
	memset(dp, 0, sizeof(dp));
	for (int i = 0; i < len; i++)
	{
		dp[i][i] = 1;
		if (i < len - 1)
		{
			if (str[i] == str[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 (str[i] == str[j] && dp[i + 1][j - 1] == 1)
			{
				dp[i][j] = 1;
				ans=L;
			}
		}
	}
	printf("%d", ans);
	return 0;
}