LightOj：1422-Halloween Costumes

传送门：http://www.lightoj.com/volume_showproblem.php?problem=1422

Halloween Costumes

problem description：

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 ith integer ci (1 ≤ ci ≤ 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

2

4

1 2 1 2

7

1 2 1 1 3 2 1

Sample Output

Case 1: 3

Case 2: 4

---

解题心得：

1. 题意就是一个人要去参见很多个化装舞会，每个化妆舞会要穿特定的衣服，那人可以一开始穿很多件衣服在身上，也可以脱下衣服，但是脱下之后的衣服不能再穿，问这个人要参加所有的化装舞会做少需要用多少衣服。
2. 其实就是一个区间dp，dp[i][k]代表从第i个化妆舞会到第j个化妆舞会需要得最少衣服，因为可以穿多件衣服所以状态转移方程式很容易就推出来了：
   
   • 如果第j个化妆舞会和第i个不同，dp[i][k]=dp[i][k-1]+1;
     
     如果相同则dp[i][k] = dp[i][k-1];
   • 然后枚举从i到j区间里面的每种匹配情况，然后更新出最少衣服的情况。

---

#include<bits/stdc++.h>
using namespace std;
const int maxn = 110;
int dp[maxn][maxn],num[maxn];
int main()
{
    int t;
    scanf("%d",&t);
    int T = 1;
    while(t--)
    {
        int n;
        scanf("%d",&n);
        for(int i=0;i<n;i++)
        {
            scanf("%d",&num[i]);
            dp[i][i] = 1;
        }

        for(int i=1;i<n;i++)
        {
            for(int j=0,k=i;k<n;k++,j++)
            {
                if(num[j] != num[k])
                    dp[j][k] = dp[j][k-1] + 1;
                else
                    dp[j][k] = dp[j][k-1];
                for(int z=j;z<k;z++)
                    if(dp[j][k] > dp[j][z] + dp[z+1][k])
                        dp[j][k] = dp[j][z] + dp[z+1][k];
            }
        }
        printf("Case %d: ",T++);
        printf("%d\n",dp[0][n-1]);
    }
    return 0;
}