还一道区间DP -- MZOJ 1346: 不老的传说

http://10.37.2.111/problem.php?id=1346

与上一道染色基本一样,就加了个限制条件(一次最多刷maxd)

#include <bits/stdc++.h>
#define read read()
#define up(i,l,r) for(int i = (l);i <=(r); i++)
using namespace std;
int read
{
    int x = ; char ch = getchar();
    while(ch <  || ch > ) ch = getchar();
    while(ch >=  && ch <= ) {x =  * x + ch - ; ch = getchar();}
    return x;
}
const int N = ;
int n,c,maxn,f[N][N],a[N],ans = INT_MAX;
int main()
{
    //freopen("spring.in","r",stdin);
    memset(f,0x3f,sizeof(f));
    n = read; c = read; maxn = read;
    up(i,,n) a[i] = a[i + n] = read;
    up(i,,((n<<) - )) f[i][i] = ;
    up(L,,n)
        up(i,,(n<<) - L)
        {
            int j = i + L - ;
            if(a[i] == a[j])
            {
                if(j - i < maxn)//一定要加,最多能刷maxn; //-> 不加88(绵中数据太水了)
                f[i][j] = min(f[i + ][j],f[i][j - ]);
            }
            else up(k,i,j - ) f[i][j] = min(f[i][j],f[i][k] + f[k + ][j]);
        }
    up(i,,n) ans = min(ans,f[i][i + n - ]);
    printf("%d",ans);
    return ;
}