Light OJ 1422 - Halloween Costumes (区间DP)
来源:互联网 发布:霸王别姬 段小楼 知乎 编辑:程序博客网 时间:2024/05/19 14:18
1、http://lightoj.com/volume_showproblem.php?problem=1422
2、题目大意:
给你n天需要穿的衣服的样式,
每次可以套着穿衣服,脱掉的衣服就不能再用了(可以再穿),问至少要带多少条衣服才能参加所有宴会
dp[i][j]表示i-j区间最少衣服数
3、题目:
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 offk of the costumes, that will be the last k ones (e.g. if he wears costumeA before costume B, to take off A, first he has to removeB).
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 containsN integers, where the ith integer ci (1 ≤ ci ≤ 100) denotes the costume he will be wearing in partyi. 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
4、AC代码:
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;#define N 105int a[N];int dp[N][N];int main(){ int t,cas=0,n; scanf("%d",&t); while(t--) { cas++; 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-1;i>=1;i--) { for(int j=i+1;j<=n;j++) { dp[i][j]=dp[i+1][j]+1; for(int k=i;k<=j;k++) { if(a[i]==a[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
- mysql远程连接 windows配置
- android面试题总结加强版(一)
- hadoop2.2.0源码编译(ubuntu下)
- ios:给appstore评分和进入app安装页面代码
- 几种华丽无比的折磨人的开发方式
- Light OJ 1422 - Halloween Costumes (区间DP)
- WebSocket握手协议
- 常见PHP套件整理
- JS中函数声明和函数表达式的区别
- lpc1768的网络通讯
- 滑动调节音量与屏幕亮度
- android tvheadend compile
- AMScrollingNavbar
- 对oracle监听做trace