首页 > 代码库 > hdu 4283 You Are the One 区间dp
hdu 4283 You Are the One 区间dp
You Are the One
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
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
Source
2012 ACM/ICPC Asia Regional Tianjin Online
#include<bits/stdc++.h>using namespace std;#define ll long longconst int N = 1005,inf=1e9+10;int a[N],pre[N];int dp[N][N];int main(){ int T,cas=1; scanf("%d",&T); while(T--) { int n; scanf("%d",&n); for(int i=1;i<=n;i++) { scanf("%d",&a[i]); pre[i]=pre[i-1]+a[i]; } memset(dp,0,sizeof(dp)); for(int i=0;i<=n;i++) { for(int j=i;j<=n;j++) dp[i][j]=inf; } for(int i=1;i<=n;i++) { for(int j=1;j+i-1<=n;j++) { int st=j; int en=j+i-1; for(int k=st;k<=en;k++) { int p=k-st+1; dp[st][en]=min(dp[st][en],dp[st+1][k]+dp[k+1][en]+p*a[st]+(pre[en]-pre[k])*p); } } } printf("Case #%d: %d\n",cas++,dp[1][n]-(pre[n])); } return 0;}/*251 2 3 4 555 4 3 2 2*/
hdu 4283 You Are the One 区间dp
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。