Light oj 1422 Halloween Costumes 区间DP

题目大意：给你n天需要穿的衣服的样式，每次可以套着穿衣服，脱掉的衣服就不能再穿了，问至少要带多少条衣服才能参加所有宴会

我的贪心错误代码：

#include "stdio.h"
#include "math.h"
#include "string.h"
#include "algorithm"
using namespace std;
const int maxn = 105;
int n;
int dp[maxn][maxn],c[maxn];
void GetDp()
{
	for( int i = 1; i <= n; i ++ )
		for( int j = i; j <= n; j ++ )
			dp[i][j] = j - i + 1;

	for( int i = n-1; 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( c[i] == c[k] )
					dp[i][j] = min( dp[i][j],dp[i+1][k-1]+dp[k][j] );
			}
		}
	}
}
int main()
{
	//freopen("data.txt","r",stdin);
	int cas;
	scanf("%d",&cas);
	for( int cs = 1; cs <= cas; cs ++ )
	{
		scanf("%d",&n);
		for( int i = 1; i <= n; i ++ )
			scanf("%d",&c[i]);
		GetDp();
		printf("Case %d: %d\n",cs,dp[1][n]);
	}
	return 0;
}