【kuangbin带你飞-区间DP-5】G - You Are the One HDU - 4283

题目链接

题目

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 .

思路：

一排屌丝男士参加非诚勿扰，每个人每等待一个前面的嘉宾完成会累加一个失望度Di,通过一个栈结构的小黑屋可以实现后面的人先参见，但是出栈后的人一定要上场了。
状态方程是dp[i][j]，表示区间[i,j]中的最小失望度。由栈结构知道，最后地出厂结果一定是所有区间的一个排列，而每个小区间内的值全部出场独立于其他的不想交的区间，所以有转移方程：
dp[i][j]=min{dp[i+1][k]+(k-i)*d[i]+(sum[j]-sum[k])+dp[k][j]) 1<=k<=j-i+1 k表示拓展的左端点i是第k个出场
这种区间dp，一个特定就是转移状态的关键点在区间左端点的扩展（或者右端点），这种题目前做的比较少，需要多训练，不好想。
这道题还需要多花时间仔细思考一点。把更清楚的原理和为什么这样能想明白。

代码

#include<bits/stdc++.h>
using namespace std;
const int maxn = 105;
const int inf = 0x3f3f3f3f;
int dp[maxn][maxn];
int sum[maxn];
int main() {
    ios::sync_with_stdio(false);
    int t;
    cin >> t;
    int n;
    int res = 0;
    for(int cs = 1; cs <= t; cs++) {

        res = 0;
        cin >> n;
        vector<int> ds(n, 0);
        for(int i = 0; i < n; i++)
            cin >> ds[i];
        sum[0] = 0;
        for(int i = 1; i <= n; i++) {
            sum[i] = sum[i - 1] + ds[i - 1];
        }
        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 = 2; l <= n; l++) {
            for(int i = 1; i + l <= n + 1; i++) {
                int j = i + l - 1;
                for(int k = 1; k <= l; k++) {
                    dp[i][j] = min(dp[i][j], ds[i - 1] * (k - 1) + (k) * (sum[j] - sum[i + k - 1]) + dp[i + 1][i + k - 1] + dp[k + i][j]);
                }
            }
        }
        printf("Case #%d: %d\n", cs, dp[1][n]);
    }
}