题解--Halloween Costumes （LightOJ 1422）

Halloween Costumes

Submit Status

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

题目大意：

给定每天需要穿什么样式的衣服，你可以选择穿任何衣服，不限量，或者脱下衣服。问，至少穿几次衣服？

思路：

用dp[i][j]表示在 从 i 到 j 天内最少需要穿衣的次数，

初始化：求最少，先将其初始化为最多，当i=j时，为1，当i<j时，为 j-i+1；当i>j时，为0；

状态转移：外重循环从后往前遍历，，使内层循环 j 不断从i向后移动，最后遍历中间节点k，若第k个和第i个相同，则在i , j 段内穿衣数目变为i~k-1以及k+1~j 内的最小穿衣数目和。

代码：

#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int main(){
    int t;
    cin>>t;
    int cas=0;
    int n,a[105],dp[105][105]={0};
    while(t--){
        cin>>n;
        for(int i=1;i<=n;i++){
            cin>>a[i];
        }
        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(a[i]==a[k]){
                        dp[i][j]=min(dp[i][j],dp[i][k-1]+dp[k+1][j]);//  用这个也可以
                    }
                }
            }
        }
        cas++;
        cout<<"Case "<<cas<<": "<<dp[1][n]<<endl;
    }
    return 0;
}

 

下面代码可看明白内存执行过程(一直有小错误，找不出来)，

#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int main(){
    int t;
    cin>>t;
    int cas=0;
    int n,a[101],dp[101][101]={0};
    while(t--){
        cin>>n;
        for(int i=1;i<=n;i++){
            cin>>a[i];
        }
        for(int i=1;i<=n;i++){
            for(int j=i;j<=n;j++){
                dp[i][j]=j-i+1;
            }
        }

cout<<"   dp[][]初始化后："<<endl;
for(int i=1;i<=n;i++){
        cout<<"  ";
    for(int j=1;j<=n;j++){
        cout<<dp[i][j]<<"  ";
    }cout<<endl;
}cout<<endl<<endl;

        for(int i=n-1;i>=1;i--){
cout<<"  i="<<i<<endl;
            for(int j=i+1;j<=n;j++){
                dp[i][j] = dp[i+1][j] + 1;
cout<<"     j="<<j<<endl;
                for(int k=i+1;k<=j;k++){
cout<<"        k="<<k<<endl;
cout<<"         a["<<i<<"]="<<a[i]<<"  a["<<k<<"]="<<a[k]<<endl;
                    if(a[i]==a[k]){
cout<<"          dp["<<i<<"]["<<j<<"]="<<dp[i][j]<<endl;
                        dp[i][j]=min(dp[i][j],dp[i][k-1]+dp[k+1][j]);//  用这个也可以
cout<<"          dp[i][k-1] + dp[k+1][j]="<<"dp["<<i<<"]["<<k-1<<"] + dp["<<k+1<<"]["<<j<<"]="<<dp[i][k-1]<<"+"<<dp[k+1][j]<<"="<<dp[i][k-1] + dp[k+1][j]<<endl;
                    }
for(int i=1;i<=n;i++){
        cout<<"         ";
    for(int j=1;j<=n;j++){
        cout<<dp[i][j]<<" ";
    }cout<<endl;
}cout<<endl<<endl;
                }
            }
        }
        cas++;
        cout<<"Case "<<cas<<" : "<<dp[1][n]<<endl;
    }
    return 0;
}

ps:在进行状态转移时 dp[i][j] = dp[i+1][j] + 1; 忘了加上，简直了，倒着求解不就是为了不断更新前面的嘛。