【sdut】1309 不老的传说问题（简单环形区间DP）

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int a[440];
int dp[440][440];
int main()
{
int n, c, k;
while (cin >> n >> c >> k)
{
for (int i = 1; i <= n; i++)
{
scanf("%d", &a[i]);
a[i + n] = a[i];
}
int l = 2 * n;
for (int i = 1; i <= l; i++)
for (int j = i; j <= l; j++)
dp[i][j] = j-i+1;

for (int len = 1; len < n; len++)
for (int i = 1; i + len <= l; i++)
{
int j = i + len;
dp[i][j] = dp[i][j - 1] + 1;
if (a[i] == a[j] && j - i + 1 <= k)
dp[i][j] = dp[i][j - 1];
for (int ll = i + 1; ll < j; ll++)
if (a[ll] == a[j] && j - ll + 1 <= k)
dp[i][j] = min(dp[i][j], dp[i][ll - 1] + dp[ll][j]);
}
int ans = 0x7ffffff;
for (int i = 1; i <= n; i++)
ans = min(ans, dp[i][i + n - 1]);
cout << ans << endl;
}
}