hdu4283You Are the One (区间DP)

最新推荐文章于 2021-07-30 15:16:14 发布

原创最新推荐文章于 2021-07-30 15:16:14 发布 · 1.3k 阅读

1 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#dp

ACM 背包&DP 专栏收录该内容

81 篇文章

订阅专栏

本文介绍了一个有趣的问题：如何通过调整排队顺序来最小化参与者的总体不幸福感。参与者根据其出场顺序会产生不同程度的不幸福感，文章提供了一种算法解决方案，通过使用动态规划方法找到最优顺序。

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

Sample Output

Case #1: 20
Case #2: 24
题意：有n个人排成一纵队，每个人都有一个不高兴值D，从第一个出去登场或进入黑屋（先进后出，可以等待也可以出去），第k个等待的人不高兴值变成（k-1）*D.
#include<stdio.h>
__int64 min(__int64 a,__int64 b)
{
    return a>b?b:a;
}
int main()
{
    int n,t,c=0;
    __int64 dp[105][105],a[105],ans[105];
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n); ans[0]=0;
        for(int i=1;i<=n;i++)
        {
            scanf("%I64d",&a[i]);
            ans[i]=ans[i-1]+a[i];
            for(int j=1;j<=n; j++)
            dp[i][j]=0;
        }
        for(int r=1;r<n;r++)
        for(int i=1;i<=n-r;i++)
        {
            int j=i+r;
            dp[i][j]=ans[j]-ans[i]+dp[i+1][j];//在区间里第一个出的情况
            for(int k=i+1;k<=j;k++)
            {
                dp[i][j]=min(dp[i][j],a[i]*(k-i)+dp[i+1][k]+(ans[j]-ans[k])*(k-i+1)+dp[k+1][j]);
            }
        }
        printf("Case #%d: %I64d\n",++c,dp[1][n]);
    }
}