题目:http://codeforces.com/problemset/problem/1132/F
题意:给出一个字符串s,每次可以删除其中一个由相同字符组成的子串,问最少需要几步?
样例:
Sample Input
5
abacaSample Output
3
Sample Input
8
abcddcbaSample Output
4
解析:区间两端相等,就可以比子区间的删除次数少一。
区间两端不等,删除次数就是两个子区间之和。
代码:
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
using namespace std;
const int inf = 0x3f3f3f3f;
#define LL long long
#define ll LL
#define zero(a) memset(a,0,sizeof(a))
#define minf(a) memset(a,inf,sizeof(a))
#define rep(i,a,b) for(int (i)=(a); (i)<=(b); ++(i))
#define rd(a) scanf("%d",&(a))
#define rld(a) scanf("%lld",&(a))
#define pf(a) printf("%d\n",(a))
const int N = 505;
int dp[N][N];
char s[N];
int main()
{
int n;
scanf("%d%s",&n,s+1);
minf(dp);
rep(i, 1, n) dp[i][i] = 1;
rep(len, 2, n){
for(int i=1; i+len-1<=n; ++i) {
int j = i + len - 1;
rep(k, i, j - 1) {
if (s[i] != s[j])
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j]);
else
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j] - 1);
}
}
}
pf(dp[1][n]);
return 0;
}