Halloween Costumes - LightOJ 1422 dp

Gappu has a very busy weekend ahead of him. Because, next weekend is Halloween, and he is planning to attend as many parties as he can. Since it's Halloween, these parties are all costume parties, Gappu always selects his costumes in such a way that it blends with his friends, that is, when he is attending the party, arranged by his comic-book-fan friends, he will go with the costume of Superman, but when the party is arranged contest-buddies, he would go with the costume of 'Chinese Postman'.

Since he is going to attend a number of parties on the Halloween night, and wear costumes accordingly, he will be changing his costumes a number of times. So, to make things a little easier, he may put on costumes one over another (that is he may wear the uniform for the postman, over the superman costume). Before each party he can take off some of the costumes, or wear a new one. That is, if he is wearing the Postman uniform over the Superman costume, and wants to go to a party in Superman costume, he can take off the Postman uniform, or he can wear a new Superman uniform. But, keep in mind that, Gappu doesn't like to wear dresses without cleaning them first, so, after taking off the Postman uniform, he cannot use that again in the Halloween night, if he needs the Postman costume again, he will have to use a new one. He can take off any number of costumes, and if he takes off k of the costumes, that will be the last k ones (e.g. if he wears costume A before costume B, to take off A, first he has to remove B).

Given the parties and the costumes, find the minimum number of costumes Gappu will need in the Halloween night.

Input

Input starts with an integer T (≤ 200), denoting the number of test cases.

Each case starts with a line containing an integer N (1 ≤ N ≤ 100) denoting the number of parties. Next line contains N integers, where the i^th integer c_i (1 ≤ c_i ≤ 100) denotes the costume he will be wearing in party i. He will attend party 1 first, then party 2, and so on.

Output

For each case, print the case number and the minimum number of required costumes.

Sample Input	Output for Sample Input
2 4 1 2 1 2 7 1 2 1 1 3 2 1	Case 1: 3 Case 2: 4

题意：一个人穿套着多件衣服去聚会。每次聚会前可以穿一件衣服，或脱若干件衣服，脱下的衣服不能再用，问至少需要多少件衣服。

思路：我们可以想到，第一场肯定穿相应的衣服，那么在后来的时候，这件衣服就没有脱的必要了，我们可以假设dp[i][j]表示从i到j的聚会，最后只留一件i的衣服所需的最少衣服数目。dp[i][j]=min(dp[i][j],dp[i][k]+dp[k+1][j]);另外当val[i]==val[k+1]时，后一种状态不需要再穿一次衣服，所以dp[i][j]=min(dp[i][j],dp[i][k]+dp[k+1][j]-1);

AC代码如下：

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int T,t,n,val[110],dp[110][110],INF=1e9;
int main()
{
    int i,j,k,d;
    scanf("%d",&T);
    for(t=1;t<=T;t++)
    {
        scanf("%d",&n);
        for(i=1;i<=n;i++)
           scanf("%d",&val[i]);
        for(i=1;i<=n;i++)
           dp[i][i]=1;
        for(d=1;d<n;d++)
           for(i=1;i+d<=n;i++)
           {
               j=i+d;
               dp[i][j]=1000;
               for(k=i;k<j;k++)
                  if(val[i]==val[k+1])
                    dp[i][j]=min(dp[i][j],dp[i][k]+dp[k+1][j]-1);
                  else
                    dp[i][j]=min(dp[i][j],dp[i][k]+dp[k+1][j]);
           }
        printf("Case %d: %d\n",t,dp[1][n]);
    }
}