zoukankan      html  css  js  c++  java
  • Hdu 4283 You Are the One

    You Are the One

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 3945    Accepted Submission(s): 1824

    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

    #include<stdio.h>
    #include<string.h>
    #include<algorithm>
    #define INF 0x3fffffff 
    using namespace std;  
    int dp[105][105];  
    int val[105],sum[105];  
    int main(){  
        int n,t,cas=0;  
        scanf("%d",&t);  
        while(t--){  
            scanf("%d",&n);  
            sum[0]=0;  
            for(int i=1;i<=n;i++){  
                scanf("%d",&val[i]);  
                sum[i]=sum[i-1]+val[i];  
            }  
            memset(dp,0,sizeof(dp));  
            for(int i=1;i<=n;i++)  
                for(int j=i+1;j<=n;j++)  
                    dp[i][j]=INF;  
            for(int l=1;l<=n-1;l++){  
                for(int i=1;i<=n-l;i++){  //两两合并                 int j=i+l;   
                    for(int k=i;k<=j;k++) //i和j之间                     dp[i][j]=min(dp[i][j],val[i]*(k-i)+(k-i+1)*(sum[j]-sum[k])+dp[i+1][k]+dp[k+1][j]);  
                }  
            }  
            printf("Case #%d: %d
    ",++cas,dp[1][n]);  
        }  
        return 0;  
    } 
    

      

    5

    5

    4

    3

    2

    2

    Sample Output

    Case #1: 20

    Case #2: 24

  • 相关阅读:
    封装好的PHP分页类,简单好用--在开源看到的,取回来自己用
    php网站判断用户是否是手机访问的方法
    三种php连接access数据库方法
    php防止SQL注入详解及防范
    mysql sql语句大全
    java util 中set,List 和Map的使用
    web开发——写一个简单的表格导出操作
    JSP登录页面使用Enter键登录【转】
    PL/SQL 将旧表的一些字段赋值给新的表中的字段的做法
    PL/SQL设置主键自增
  • 原文地址:https://www.cnblogs.com/zhangliu/p/7063233.html
Copyright © 2011-2022 走看看