hdu 4283 You Are the One(区间dp)
来源:互联网 发布:超市毛利率算法 编辑:程序博客网 时间:2024/06/16 12:59
题目链接
You Are the One
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3329 Accepted Submission(s): 1508
Problem Description
The TV shows such as You Are the One has been very popular. In order to meet the need of boys who are still single, TJUT hold the show itself. The show is hold in the Small hall, so it attract a lot of boys and girls. Now there are n boys enrolling in. At the beginning, the n boys stand in a row and go to the stage one by one. However, the director suddenly knows that very boy has a value of diaosi D, if the boy is k-th one go to the stage, the unhappiness of him will be (k-1)*D, because he has to wait for (k-1) people. Luckily, there is a dark room in the Small hall, so the director can put the boy into the dark room temporarily and let the boys behind his go to stage before him. For the dark room is very narrow, the boy who first get into dark room has to leave last. The director wants to change the order of boys by the dark room, so the summary of unhappiness will be least. Can you help him?
Input
The first line contains a single integer T, the number of test cases. For each case, the first line is n (0 < n <= 100)
The next n line are n integer D1-Dn means the value of diaosi of boys (0 <= Di <= 100)
The next n line are n integer D1-Dn means the value of diaosi of boys (0 <= Di <= 100)
Output
For each test case, output the least summary of unhappiness .
Sample Input
2 512345554322
Sample Output
Case #1: 20Case #2: 24
理解此题的题意是关键,此题这个小黑屋是个栈,男生的顺序是排好了的,但是可以通过入栈出栈来改变男屌的出场顺序
题解
#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>using namespace std;const int maxn=100+5;const int inf=0x3f3f3f3f;int a[maxn],sum[maxn];int d[maxn][maxn];int main(){ int cas; scanf("%d",&cas); for(int kase=1;kase<=cas;kase++) { int n; scanf("%d",&n); memset(d,0,sizeof(d)); sum[0]=0; for(int i=1;i<=n;i++) for(int j=i+1;j<=n;j++) d[i][j]=inf; for(int i=1;i<=n;i++) scanf("%d",&a[i]),sum[i]=sum[i-1]+a[i]; for(int i=n;i>0;i--) for(int j=i;j<=n;j++) for(int k=1;k<=j-i+1;k++) d[i][j]=min(d[i][j],d[i+1][i+k-1]+d[i+k][j]+a[i]*(k-1)+(sum[j]-sum[i+k-1])*k); printf("Case #%d: %d\n",kase,d[1][n]); }}
0 0
- HDU 4283 You Are the One 区间dp
- hdu 4283 You Are the One 区间dp
- HDU 4283 You Are the One(区间DP)
- hdu 4283 You Are the One(区间dp)
- HDU --4283--You Are the One--区间DP
- hdu 4283 You Are the One(区间DP)
- HDU 4283 You Are the One(区间dp)
- HDU 4283 You Are the One 区间dp
- HDU 4283 You Are the One (区间DP)
- HDU 4283 You Are the One(区间dp)
- hdu 4283 You Are the One(区间dp)
- Hdu 4283 You Are the One(区间dp)
- HDU 4283 You are the one(区间DP)
- HDU 4283 You Are the One(区间DP)
- HDU 4283 You Are the One (区间dp)
- HDU 4283 You Are the One(区间dp)
- hdu 4283 You are the one 区间dp
- HDU 4283 You Are the One (区间DP)
- tjut 3023
- cpu_freq之init
- View的事件分发机制(View篇)
- 笔记18 ValueAnimator总结 及用ValueAnimator实现0-100计数效果
- S5PV210的时钟控制器-clock management unit(CMU)
- hdu 4283 You Are the One(区间dp)
- OC中的Data
- 通过反射获取静态常量字段的值
- 每隔2个数删除一个数的删数问题
- 利用Viewpager+Timer实现图片广告轮播
- 最长公共子序列问题
- 51NOD--动态规划
- PHP菜鸟进阶--php中的可变变量
- 国内镜像下载Android源码