Lightoj 1422 （区间dp）

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

Status

Practice

LightOJ 1422

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

题目大意：t组测试数据， n个party， 每个party要穿的衣服种类，这个人可以套n层衣服，每个衣服1块钱，衣服可以脱下来，脱下了就不能用了，问你怎么穿最省钱
题解：区间dp的练习所以就是区间dp咯，想一下区间，所以dp【i】【j】就是从 i 到 j 这个区间里面搞事，找一下状态转移方程，好好想想就发现两件穿的相同的衣服里面有猫腻，当 i < k < j 时，如果val【k】==val【j】时，就有dp【i】【j】=min（dp【i】【j】， dp【i】【k】 + dp【k+1】【j-1】），这个是因为j 和 k如果一样那么可以把中间都脱掉，花费还是要继续算上的，不然没有联系是不对的；

#include <cstdio>
#include <cstring>
#include <stack>
using namespace std;
#define M 1010
int val[M], dp[M][M];
int main()
{
    int t, n, ans, temp;
    scanf("%d", &t);
    for(int ca=1; ca<=t; ca++)
    {
        scanf("%d", &n);
        ans = 0;
        memset(dp, 0, sizeof(dp));
        for(int i=1; i<=n; i++)
        {
            scanf("%d", &val[i]);
            dp[i][i] = 1;
        }
        int j, i;
        for(j=2; j<=n; j++)//对于循环，要把那个放在外面还是要继续练习啊
        {
            for(i=1; i<=j; i++)
            {
                dp[i][j] = dp[i][j-1] + 1;//这里是一个情况，或许不需要脱衣服是最好的
                for(int k=i; k<j; k++)
                {
                    if(val[j] == val[k])
                    {
                        dp[i][j] = min(dp[i][j], dp[i][k] + dp[k+1][j-1]);
                    }
                }
            }
        }
        printf("Case %d: %d\n", ca, dp[1][n]);

    }


    return 0;
}