You Are the One_区间DP

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)

Total Submission(s) : 27   Accepted Submission(s) : 14

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

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

解题思路 ：

dp[i][j]表示区间[i,j]的最小总不开心值

从[i,j]来看，i既可以第一个上场，也可以最后（j-i+1）上场，也可以在（1~j-i+1）之间任意值

不妨设他是第k个出场的（1<=k<=j-i+1)，那么根据栈后进先出的特点，以及原先男的是排好序的，那么：

第  i+1  到 i+k-1  总共有k-1个人要比i先出栈，

第 i+k   到j 总共j-i-k+1个人在i后面出栈

举个例子吧：

有5个人事先排好顺序  1,2,3,4,5

入栈的时候，1入完2入，2入完3入，如果我要第1个人第3个出场，那么入栈出栈顺序是这样的：

1入，2入，3入，3出，2出，1出（到此第一个人就是第3个出场啦，很明显第2，3号人要在1先出，而4,5要在1后出）

这样子， 动态转移方程 就出来啦，根据第i个人是第k个出场的，将区间[i,j]分成3个部分

dp[i][j]=min(dp[i][j],dp[i+1,i+k-1]+dp[i+k,j]+(k-1)*a[i]+(sum[j]-sum[i+k-1])*k);   

(sum[j]-sum[i+k-1])*k 表示 后面的 j-i-k+1个人是在i后面才出场的，那么每个人的不开心值都会加个 unhappy，sum[i]用来记录前面i个人的总不开心值，根据题目，每个人的unhappy是个 累加的过程 ，多等一个人，就多累加一次

—————————————————————————————————分割线———————————————————————————————

#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
#define inf 0x7777777;
const int N=105;
int a[N],sum[N];
int dp[N][N];
int min(int a,int b)
{
    return a<b?a:b;
}

int main()
{
    int t,cas=0,n;
    cin>>t;
    while(t--)
    {
        cas++;
        cin>>n;
        memset(sum,0,sizeof(sum));
        for(int i=1; i<=n; i++)
           {
               cin>>a[i];
            sum[i]=sum[i-1]+a[i];
           } 
        int i,j;
        memset(dp,0,sizeof(dp));
        for(i=1; i<=n; i++)
            for(j=i+1; j<=n; j++)
            {
                dp[i][j]=inf;
            }
        for(int l=1; l<n; l++)
        {
            for(i=1; i<=n-l; i++)
            {
                j=i+l;
                for(int k=1; k<=j-i+1; k++)
                {
                    dp[i][j]=min(dp[i][j],dp[i+1][i+k-1]+dp[i+k][j]+(k-1)*a[i]+(sum[j]-sum[i+k-1])*k);
                }
            }
        }
       printf("Case #%d: %d
",cas,dp[1][n]);
    }
    return 0;
}