Light OJ 1422 Halloween Costumes

传送门

 Halloween Costumes

　　　　　　　　　　　　　　　　　　　　Time Limit:2000MS     Memory Limit:32768KB     64bit IO Format:%lld & %llu

 

Appoint description:

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 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

2

4

1 2 1 2

7

1 2 1 1 3 2 1

Sample Output

Case 1: 3

Case 2: 4

 

很经典的dp模型 ， 考虑i到j需要f[i][j]件衣服 ， 那么如果i这件衣服只被i用 ， 花费应为 f[i+1][j]+1， 否则 在i+1~j中肯定有一个k也用了i这件衣服，即f[i+1][k-1]+f[k][j]。

那么f[i][j]=min(f[i+1][j]+1,f[i+1][k-1]+f[k][j])

#include<set>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 110;
#define For(i,n) for(int i=1;i<=n;i++)
#define Rep(i,l,r) for(int i=l;i<=r;i++)
#define Down(i,r,l) for(int i=r;i>=l;i--)
//dp[i][j]=min(dp[i+1][j]+1,dp[i+1][k-1]+dp[k][j]);

int A[N],n,dp[N][N],T;
void DP(){
    For(i,n)
      Rep(j,i,n)
        dp[i][j]=j-i+1;
    Down(i,n-1,1)
      Rep(j,i,n){
          dp[i][j]=dp[i+1][j]+1;
          Rep(k,i,j)
            if(A[k]==A[i])
              dp[i][j]=min(dp[i][j],dp[i+1][k-1]+dp[k][j]);
      }
    cout<<dp[1][n]<<endl;
}

void init(){
    scanf("%d",&T);int id=1;
    while(id<=T){
        scanf("%d",&n);
        For(i,n) scanf("%d",&A[i]); 
        printf("Case %d: ",id++);
        DP();
    }
}

int main(){
    init();
    return 0;
}