1025 - The Specials Menu

题目链接:点击打开链接

题意：一个字符串中回文串的个数

题解：动态规划，cont[i][j]存储从I到j的回文串个数,则当a[I] == a[j]时，就等于cont[I+1][j]+cont[I][j-1]+1(a[I]和a[j]这对单独算一个)

否则 cont[I+1][j-1]+cont[I][j-1]还要减去重复计算的cont[I+1][j-1],此题关键在于dp

代码:

#include <iostream>
#include <cstdio>
#include <queue>
#include <cstring>
using namespace std;
#define ll long long

char a[100];
ll cont[100][100];

void solve()
{
	memset(cont, 0, sizeof(cont));
	int n = strlen(a);
	for (int i = 0; i < n; i++)
		cont[i][i] = 1;
	for (int i = n-2; i >=0 ; i--)
	{
		for (int j = i+1; j < n; j++)
		{
			cont[i][j] = cont[i + 1][j] + cont[i][j - 1];
			if (a[i] != a[j])
				cont[i][j] -= cont[i + 1][j - 1];
			else
				cont[i][j]++;
		}
	}
	return;
}

int main()
{
	int test;
	scanf("%d", &test);
	for (int cas = 1; cas <= test; cas++)
	{
		scanf("%s", a);
		solve();
		printf("Case %d: %lld\n", cas, cont[0][strlen(a) - 1]);
	}
	return 0;
}