B - Halloween Costumes

 #include <iostream>
 #include <algorithm>
 #include <cstring>
 #include <cstdio>
 #include <string>
 #include <map>
 #include <cmath>
 #include <vector>

 #define Faster ios::sync_with_stdio(false),cin.tie(0)
 #define Read freopen("in.txt","r",stdin),freopen("out.txt","w",stdout)
 #define Close fclose(stdin),fclose(stdout)
 const int maxn = ;
 using namespace std;
 const int MOD = 1e9+;
 typedef long long ll;

 int a[maxn];
 int dp[maxn][maxn];
 //dp[i][j],从区间i -> j 穿的最少的衣服数量

 int main(){
     Faster;
     int t;
     cin >> t;
     int cnt = ;
     while(t--){
         cnt++;
         int n;
         cin >> n;
         for(int i = ;i <= n;i++){
             cin >> a[i];
         }
         //初始化，每件都穿上
         for(int i = ;i <= n;i++){
             for(int j = i;j <= n;j++){
                 dp[i][j] = j-i+;
             }
         }
         for(int i = n-;i >= ;i--){
             for(int j = i+;j <= n;j++){
                 dp[i][j] = dp[i+][j] + ;
                 for(int k = i;k <= j;k++){
                     if(a[i] == a[k]){
                         dp[i][j] = min(dp[i][j], dp[i+][k-] + dp[k][j]);
                     }
                 }
             }
         }
         cout << "Case " << cnt << ": " << dp[][n] << endl;
     }
     return ;
 }