Light OJ 1422 Halloween Costumes (区间DP)
来源:互联网 发布:prim和kruskal算法 编辑:程序博客网 时间:2024/05/19 12:37
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
Output for Sample Input
2
4
1 2 1 2
7
1 2 1 1 3 2 1
Case 1: 3
Case 2: 4
#include<iostream>#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<algorithm>using namespace std;typedef long long ll;const int maxn= 105;const int INF = 0x3f3f3f3f;int t,n;int a[maxn];int dp[maxn][maxn];int main(){ int t,ca=0; scanf("%d",&t); while(t--) { scanf("%d",&n); for(int i=1;i<=n;i++){ scanf("%d",&a[i]); } memset(dp,0,sizeof(dp)); for(int i=1;i<=n;i++) dp[i][i]=1; for(int i=n;i>=1;i--){ for(int j=i+1;j<=n;j++){ dp[i][j]=dp[i][j-1]+1; for(int k=i;k<j;k++){ if(a[k]==a[j]) dp[i][j]=min(dp[i][j],dp[i][k]+dp[k+1][j-1]); } } } ca++; printf("Case %d: %d\n",ca,dp[1][n]); }}
- Light oj 1422 Halloween Costumes(区间 dp)
- Light OJ 1422 - Halloween Costumes (区间DP)
- Light oj 1422 Halloween Costumes 区间DP
- Light OJ 1422 Halloween Costumes(区间DP)
- light oj 1422 Halloween Costumes (区间DP)
- light oj 1422 - Halloween Costumes (区间dp)
- light oj 1422 Halloween Costumes(区间dp)
- Light OJ 1422 Halloween Costumes(区间DP)
- light oj 1422 Halloween Costumes (区间DP)
- Light OJ 1422 Halloween Costumes(区间DP)
- Light OJ 1422 Halloween Costumes (区间DP)
- Light oj 1422 Halloween Costumes 区间DP ★★★
- Light oj 1422 Halloween Costumes(区间DP:迭代or记忆化搜索)
- 【DP】 Light OJ 1422 Halloween Costumes
- Light oj 1422 Halloween Costumes
- Light oj 1422 - Halloween Costumes
- Light oj1422 Halloween Costumes 区间DP
- LightOJ - 1422 Halloween Costumes (区间DP)
- Protobuf简单例子
- HDU 4745 Two Rabbits (区间DP)
- Android Ethernet从上至下解析一
- 通过键盘把数据输入数组,只能越来越大
- jQuery 创建和插入元素
- Light OJ 1422 Halloween Costumes (区间DP)
- Hbase初识
- 小代码测试你能不能简单区分局部和全局变量
- windows环境下Android环境变量配置(新手专用)
- 深入理解Java虚拟机--java内存模型与线程
- Mysql忘记密码
- 如何把MYD,MYI文件导入到MYSQL数据库中?
- POJ 3186 Treats for the Cows (区间DP)
- Android之Inflate()方法用途