You Are the OneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6649 Accepted Submission(s): 3305 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)
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 |
n个diaosi排队上场上场的时候会有愤怒值愤怒值为 他前面人的个数*Di,老板有个栈可以让他进去呆一会这时候排在他后面的人就会上场问如何利用栈才可以使所有人的怒气值最小。
dp[i][j]表示从i到j这个区间中的怒气的最小值。然后枚举k让第i个人第k次上场(这里的k是从1~j-i+1并不是整个区间长度上的这里没看出来一直调不出来)。注意初始化dp数组。
#include<bits/stdc++.h>
using namespace std;
const long long inf=1000000009;
int dp[110][101],a[1002],d[1002];
int main(){
int n,h;
int ans=0;
scanf("%d",&n);
while(n--)
{
memset(dp,0,sizeof(dp));
scanf("%d",&h);
ans++;
d[0]=0;
for(int i=1;i<=h;i++)
{
cin>>a[i];
d[i]=d[i-1]+a[i];
}
for(int i=1;i<=h;i++)
{
for(int j=i+1;j<=h;j++)
dp[i][j]=0x3f3f3f3f;
}
for(int i=1;i<=h;i++)
{
for(int j=1;i+j-1<=h;j++)
{
int r=i+j-1;
for(int k=1;k<=i;k++)
{
dp[j][r]=min(dp[j][r],dp[j+1][j+k-1]+dp[j+k][r]+k*(d[r]-d[j+k-1])+(k-1)*a[j]);
}
}
}
printf("Case #%d: %d\n",ans,dp[1][h]);
}
}