zoukankan      html  css  js  c++  java
  • HDU 4283 You are the one

    传送门

    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
     
    利用小黑屋的性质可以确定区间dp的依据
     1 #include<set>
     2 #include<queue>
     3 #include<cstdio>
     4 #include<cstdlib>
     5 #include<cstring>
     6 #include<iostream>
     7 #include<algorithm>
     8 using namespace std;
     9 const int N = 1010;
    10 #define For(i,n) for(int i=1;i<=n;i++)
    11 #define Rep(i,l,r) for(int i=l;i<=r;i++)
    12 #define Down(i,r,l) for(int i=r;i>=l;i--)
    13 int num[N],sum[N];
    14 int dp[N][N];
    15 int T,n,cases;
    16 int main(){
    17     scanf("%d",&T);
    18     while(T--){
    19         cases++;
    20         scanf("%d",&n);
    21         sum[0]=0;
    22         For(i,n){
    23             scanf("%d",&num[i]);
    24             sum[i]=sum[i-1]+num[i];
    25         }
    26         For(i,n){
    27            Rep(j,i,n)
    28              dp[i][j]=1<<30;
    29            dp[i][i]=0;
    30         }
    31         For(len,n-1)
    32            For(i,n-len){
    33                int j=i+len;
    34                dp[i][j]=min(dp[i][j],dp[i+1][j]+sum[j]-sum[i]);
    35                Rep(k,i+1,j)
    36                  dp[i][j]=min(dp[i][j],dp[i+1][k]+num[i]*(k-i)+dp[k+1][j]+(sum[j]-sum[k])*(k-i+1));
    37            }
    38         printf("Case #%d: %d
    ",cases,dp[1][n]);
    39     }
    40     return 0;
    41 }
  • 相关阅读:
    ajax(读取json数据)
    MD5加密出现 无法启动:此实现不是Windows平台FIPS验证的加密算法的一部分
    二维码(android)
    电脑快捷键大全
    OkHttp
    HttpURLConnection 传输数据和下载图片
    子线程更新UI界面的2种方法
    URLConnection(互联网)
    点滴
    SQL 备忘录
  • 原文地址:https://www.cnblogs.com/zjdx1998/p/4069927.html
Copyright © 2011-2022 走看看