You Are the One HDU - 4283

最新推荐文章于 2024-02-01 00:52:38 发布

原创最新推荐文章于 2024-02-01 00:52:38 发布 · 173 阅读

0 ·

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

收录于

动态规划

该博客讨论了一个电视节目安排问题，其中单身男孩按顺序上台，每个人都有一个‘diaosi’值，代表等待上台的愤怒值。导演可以利用黑暗房间调整男孩们的顺序以减少总体愤怒值。博主通过动态规划算法找到了最小化总愤怒值的策略，并给出了样例输入和输出。

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
一群人上台，晚上会产生愤怒值，

#include <stdio.h>
#include <string.h>
#include <algorithm>
#include<bits/stdc++.h>
#define inf 0x3f3f3f3f
using namespace std;
typedef long long ll;
const int N = 300;
int a[N],sum[N],book[N];
int dp[N][N];
int main()
{
    int t,cas=1;
    scanf("%d",&t);
    while(t--)
    {
        int i,j,len,k,n;
        scanf("%d",&n);
        sum[0]=0;
        for(i=1; i<=n; i++)
        {
            scanf("%d",&a[i]);
            sum[i]=sum[i-1]+a[i];
        }
        memset(dp,0,sizeof(dp));
        for(i=1; i<=n; i++)
        {
            for(j=i+1; j<=n; j++)
                dp[i][j] = inf;
        }
        for(len=2; len<=n; len++)
        {
            for(i=1; i+len-1<=n; i++)
            {
                j=i+len-1;
                for(k=1; k<=j-i+1; k++)
                {
                    dp[i][j]=min(dp[i][j],dp[i+1][i+k-1]+dp[i+k][j]+
                    a[i]*(k-1)+k*(sum[j]-sum[i+k-1]));
                }
            }
        }
        printf("Case #%d: %d\n",cas++,dp[1][n]);
    }
    return 0;
}