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[],n;
 int dp[][];
 
 int dfs(int l,int r)
 {
     if(r < l) return ;
     if(dp[l][r] != -)
         return dp[l][r];
     if(l == r)
         return dp[l][r] = ;
     dp[l][r] = r-l+;
 
     dp[l][r] = min(dfs(l+,r)+,dp[l][r]); //新穿一件
 
     for(int i = l+; i <= r; i++)
     {
         if(color[l] == color[i])
             dp[l][r] = min(dp[l][r],dfs(l+,i-)+dfs(i,r)); //l == i 不用新穿
     }
     return dp[l][r];
 }
 
 void solve()
 {
     scanf("%d",&n);
     memset(dp,-,sizeof(dp));
     for(int i = ; i <= n; i++)
         scanf("%d",&color[i]);
     int ans = dfs(,n);
 
     printf("%d\n",ans);
 }
 
 int  main(void)
 {
 
     int t,cnt = ;
     scanf("%d",&t);
     while(t--)
     {
         printf("Case %d: ",++cnt);
         solve();
     }
     return ;
 }