HDU4283——You Are the One(区间dp)

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) 

Output

  For each test case, output the least summary of unhappiness . 

Sample Input

2
  
5
1
2
3
4
5

5
5
4
3
2
2

Sample Output

Case #1: 20
Case #2: 24



题意很绕啊

有一群要上场的屌丝,每个人有个值d,如果他第k个上场,那他不开心的值就是(k-1)*d

现在有个小黑屋= =(一个栈),轮到某个人的时候,有两个选择,把他丢进小黑屋,或者让他直接上场。


dp[i][j]表示这段区间的最小值。这里的意思是把每个区间当做一个子问题,也就是相当于区间(1,j-i+1)。

枚举区间第一个人的上场时间。

如果在第m个上场,那么m个往后的人就要用dp[m+1][j]+sum[m+1...j]*(m-i+1)

预处理一下前缀和


#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <cmath>
#include <cstdlib>
#include <iostream>
using namespace std;
const int MAXN =310;
const int INF =1000000007 ;
const int MOD =1000000007;
const double EPS=1e-8;
const double pi = acos(-1);

int dp[MAXN][MAXN];
int a[MAXN];
int sum[MAXN];
int main(){
    int t;
    scanf("%d",&t);
    for(int cas=1;cas<=t;cas++){
        int n;
        scanf("%d",&n);
        memset(sum,0,sizeof(sum));
        for(int i=1;i<=n;i++){
            scanf("%d",a+i);
            sum[i]=sum[i-1]+a[i];
        }
        memset(dp,0,sizeof(dp));
        for(int k=0;k<n;k++){
            for(int i=1;i+k<=n;i++){
                int j=i+k;
                dp[i][j]=INF;
                for(int m=i;m<=j;m++){
                    int temp=m-i+1;
                    dp[i][j]=min(dp[i][j],dp[i+1][m]+a[i]*(temp-1)+dp[m+1][j]+(sum[j]-sum[m])*temp);
                }
            }
        }
        printf("Case #%d: ",cas);
        printf("%d\n",dp[1][n]);
    }
}











  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 1
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值