loj 1422 区间dp Halloween Costumes

题目链接：http://lightoj.com/volume_showproblem.php?problem=1422

题意：给出n个数表示参见该舞会需要的衣服数量，按顺序去参加舞会。可以连续穿好多件衣服。需要时候就脱下来，一旦脱下来，这件衣服就报废了。问最少需要几件衣服。

dp[i][j] 表示从i到j需要的衣服

初始化dp[i][i] = 1,因为本身到本身需要的数量是1

dp[i][j] = dp[i][j-1] (a[i] == a[j])

dp[i][j] = min(dp[i][j],dp[i][k]+dp[k+1][j]) (a[i] == a[k])

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;

const int inf = 0x3f3f3f3f;
const int maxn = 105;
int a[maxn];
int dp[maxn][maxn];
int n;

int main()
{
    ios::sync_with_stdio(false);
    int t;
    cin >> t;
    for(int cas = 1; cas <= t; cas++) 
    {
        memset(dp, 0, sizeof dp);
        cin >> n;
        for(int i = 1; i <= n; i++)
            cin >> a[i];
        for(int i = 1; i <= n; i++)
            dp[i][i] = 1;
        for(int l = 1; l <= n; l++)
            for(int i = 1; i+l <= n; i++)
            {
                int j =  l+i;
                dp[i][j] = inf;
                if(a[i] == a[j])
                    dp[i][j] = dp[i][j-1];
                for(int k = i; k < j; k++)
                {
                    if(a[i] == a[k]) 
                        dp[i][j] = min(dp[i][j], dp[i][k]+dp[k+1][j]);
                } 
            }
        printf("Case %d: %d\n", cas, dp[1][n]);     
    }
    return 0;
 }