light oj 1422 区间dp

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <climits>
#include <queue>
#define ll long long

using namespace std;

int color[105],n;
int dp[105][105];

int dfs(int l,int r)
{
    if(r < l) return 0;
    if(dp[l][r] != -1)
        return dp[l][r];
    if(l == r)
        return dp[l][r] = 1;
    dp[l][r] = r-l+1;

    dp[l][r] = min(dfs(l+1,r)+1,dp[l][r]); //新穿一件

    for(int i = l+1; i <= r; i++)
    {
        if(color[l] == color[i])
            dp[l][r] = min(dp[l][r],dfs(l+1,i-1)+dfs(i,r)); //l == i 不用新穿
    }
    return dp[l][r];
}

void solve()
{
    scanf("%d",&n);
    memset(dp,-1,sizeof(dp));
    for(int i = 1; i <= n; i++)
        scanf("%d",&color[i]);
    int ans = dfs(1,n);

    printf("%d
",ans);
}

int  main(void)
{

    int t,cnt = 0;
    scanf("%d",&t);
    while(t--)
    {
        printf("Case %d: ",++cnt);
        solve();
    }
    return 0;
}