Light OJ 1422 Halloween Costumes(区间DP)
来源:互联网 发布:linux shell编程例子 编辑:程序博客网 时间:2024/05/19 14:55
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 offA, 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
Source
区间DP:第i天可能穿新的也可能是前面的衣服。#include<cstdio>#include<cstring>#include<algorithm>#include<vector>#include<string>#include<iostream>#include<queue>#include<cmath>#include<map>#include<stack>#include<bitset>using namespace std;#define REPF( i , a , b ) for ( int i = a ; i <= b ; ++ i )#define REP( i , n ) for ( int i = 0 ; i < n ; ++ i )#define CLEAR( a , x ) memset ( a , x , sizeof a )typedef long long LL;typedef pair<int,int>pil;const int INF = 0x3f3f3f3f;int t,n;int dp[110][110];int num[110];int main(){ int cas=1; scanf("%d",&t); while(t--) { scanf("%d",&n); REPF(i,1,n) scanf("%d",&num[i]); CLEAR(dp,0); for(int i=1;i<=n;i++) dp[i][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(num[i]==num[k]) dp[i][j]=min(dp[i][j],dp[i+1][k-1]+dp[k][j]); } } } printf("Case %d: %d\n",cas++,dp[1][n]); } return 0;}/*241 2 1 271 2 1 1 3 2 1*/
- 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)
- 【DP】 Light OJ 1422 Halloween Costumes
- Light oj 1422 Halloween Costumes
- Light oj 1422 - Halloween Costumes
- Light oj 1422 Halloween Costumes(区间DP:迭代or记忆化搜索)
- Light oj1422 Halloween Costumes 区间DP
- light oj Halloween Costumes
- Python调用windows下DLL详解 - ctypes库的使用
- bat脚本
- 第三章P122T6,10,14,15,17,21
- HALCON机器视觉图像处理软件之应用三
- Linux学习笔记(系统日常管理-4)
- Light OJ 1422 Halloween Costumes(区间DP)
- iOS项目中常用的第三方开源库
- 使用nodejs 踩坑微信JS-SDK记录
- Ubuntu常用命令总结
- 关于iOS在程序中检测sim卡切换和获取手机号的问题
- pl/sql代码中不得犯的错误!
- 优秀项目经理必备的8个要素
- 中值滤波--sj
- 图像的各种采样方法