bzoj1260

区间dp
最近一直在做水的dp
白天要上课。。。时间好少

#include<bits/stdc++.h>using namespace std;#define FOR(i,s,t) for(int i=(s);i<=(t);i++)inline int read(void){    int x = 0, c, f = 1;    do{c=getchar();if(c=='-')f=-1;}while(c<'0'||c>'9');    do{x=x*10+c-'0';c=getchar();}while(c>='0'&&c<='9');    return x * f;}const int N = 60, INF = 0x3f3f3f3f;char s[N];int f[N][N], n;void DP(void) {    for (int i = 1; i <= n; i++)        for (int j = 1; j <= n; j++)            f[i][j] = i==j ? 1 : INF;    for (int i = 2; i <= n; i++) {        for (int l=1,r=i; r <= n; r++,l++) {            if (s[l] == s[r]) {                f[l][r] = min(f[l+1][r], f[l][r-1]);                f[l][r] = min(f[l+1][r-1]+1,f[l][r]);            }            else for (int d = l; d < r; d++) {                f[l][r] = min(f[l][r], f[l][d] + f[d+1][r]);            }        }    }} int main(){    scanf("%s",s+1);    n = strlen(s + 1);    DP();    cout << f[1][n] << endl;}