zoukankan      html  css  js  c++  java
  • 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)
     
    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
     
    Source
    #include<bits/stdc++.h>
    using namespace std;
    #define ll long long
    const 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
    ",cas++,dp[1][n]-(pre[n]));
        }
        return 0;
    }
    /*
    2
    5
    1 2 3 4 5
    5
    5 4 3 2 2
    */
  • 相关阅读:
    让我一生一世呵护你
    看美女无数
    跨越人生五个修炼爱上这个诡秘的人生
    太空欢迎你
    只要你记得我的好
    最美的十大精典爱情句子
    袁桂英(帮别人名字作诗)
    张紫秋(帮别人名字作诗)
    爱情是毒药
    博客文化将成为草根崛起的一片热土
  • 原文地址:https://www.cnblogs.com/jhz033/p/6129077.html
Copyright © 2011-2022 走看看