light oj 1422 - Halloween Costumes

#include <string.h>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <iostream>
#include <queue>
#include <algorithm>
#define MAXSIZE 1005
#define LL long long
#define INF 0x3f3f3f
#define mod 10056

using namespace std;

int dp[MAXSIZE][MAXSIZE],a[MAXSIZE];

int Solve(int n)
{
    for(int i=0;i<MAXSIZE;i++)
    {
        for(int j=i;j<MAXSIZE;j++)
        {
            dp[i][j] = j-i+1;
        }
    }

    for(int i=n;i>=1;i--)
    {
        for(int j=i+1;j<=n;j++)
        {
            dp[i][j] = dp[i+1][j] + 1;
            for(int k=i+1;k<=j;k++)
            {
                if(a[k] == a[i])
                {
                    dp[i][j] = min(dp[i][k-1]+dp[k+1][j],dp[i][j]);
                }
            }
        }
    }
    return dp[1][n];
}

int main()
{
    int T,n,cns=1;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        for(int i=1;i<=n;i++)
            scanf("%d",&a[i]);
        int ans = Solve(n);
        printf("Case %d: %d\n",cns++,ans);
    }
    return 0;
}