题目大意:定义特殊回文串,例如:abcdcba(a <= b <= c <= d)
给出n,问:a+b+c+d+c+b+a的值为n的回文串的方法数有多少?
题目思路:
dp[i][j] //表示值为i,以j开头的方法数有多少
以下是代码:
#include <iostream>
#include <iomanip>
#include <fstream>
#include <sstream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <cctype>
#include <algorithm>
#include <functional>
#include <numeric>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <vector>
#include <queue>
#include <deque>
#include <list>
using namespace std;
long long dp[500][500];
long long ans[500];
void init()
{
dp[0][1] = 1;
dp[1][1] = 1;
dp[2][1] = 1;dp[2][2] = 1;
dp[3][1] = 1;dp[3][3] = 1;
ans[1] = 1;ans[2] = 2;ans[3] = 2;
for (int i = 4; i <= 250; i++)
{
long long tmp = 0;
for (int j = 1; j <= i / 2; j++)
{
if (j == 1) dp[i][j] = ans[i - 2];
else
{
long long u = i - j * 2;
if (u == 0)
{
dp[i][j] = 1;
}
else
{
long long ret = 0;
for (int k = j; k <= u; k++)
{
ret += dp[u][k];
}
dp[i][j] = ret;
}
}
tmp += dp[i][j];
}
dp[i][i] = 1;
tmp += 1;
ans[i] = tmp;
}
}
int main()
{
int n;
init();
while(cin >> n)
{
if (n == 0) break;
cout << ans[n] << endl;
}
return 0;
}