2017北京网络赛 J Pangu and Stones 区间DP（石子归并）

#1636 : Pangu and Stones

时间限制:1000ms

单点时限:1000ms

内存限制:256MB

描述

In Chinese mythology, Pangu is the first living being and the creator of the sky and the earth. He woke up from an egg and split the egg into two parts: the sky and the earth.

At the beginning, there was no mountain on the earth, only stones all over the land.

There were N piles of stones, numbered from 1 to N. Pangu wanted to merge all of them into one pile to build a great mountain. If the sum of stones of some piles was S, Pangu would need S seconds to pile them into one pile, and there would be S stones in the new pile.

Unfortunately, every time Pangu could only merge successive piles into one pile. And the number of piles he merged shouldn't be less than L or greater than R.

Pangu wanted to finish this as soon as possible.

Can you help him? If there was no solution, you should answer '0'.

输入

There are multiple test cases.

The first line of each case contains three integers N,L,R as above mentioned (2<=N<=100,2<=L<=R<=N).

The second line of each case contains N integers a₁,a₂ …a_N (1<= a_i  <=1000,i= 1…N ), indicating the number of stones of  pile 1, pile 2 …pile N.

The number of test cases is less than 110 and there are at most 5 test cases in which N >= 50.

输出

For each test case, you should output the minimum time(in seconds) Pangu had to take . If it was impossible for Pangu to do his job, you should output  0.

样例输入

3 2 2
1 2 3
3 2 3
1 2 3
4 3 3
1 2 3 4

样例输出

9
6
0

题意：

n个石子堆排成一排，每次可以将连续的最少L堆，最多R堆石子合并在一起，消耗的代价为要合并的石子总数。

求合并成1堆的最小代价，如果无法做到输出0

 

题解：

石子归并系列题目，一般都是区间DP,于是——

dp[i][j][k] i到j 分为k堆的最小代价。显然 dp[i][j][ j-i+1]代价为0

然后[i,j] 可以划分

dp[i][j][k]  = min { dp[i][d][k-1] + dp[d+1][j][1] } (k > 1&&d-i+1 >= k-1，这个条件意思就是 区间i,d之间最少要有k-1个石子) 

最后合并的时候 

dp[i][j][1] = min{ dp[i][d][k-1] + dp[d+1][j][1]  + sum[j] - sum[i-1] }  (l<=k<=r)

 

#include<iostream>
#include<string.h>
#include<string>
#include<algorithm>
#include<math.h>
#include<string>
#include<string.h>
#include<vector>
#include<utility>
#include<map>
#include<queue>
#include<set>
#define mx 0x3f3f3f3f
#define ll long long
using namespace std;
int n, l,r;
int dp[105][105][105],sum[105],a[105];
//dp[i][j][t]表示区间[i,j]分为k堆的最小代价
int main()
{
    while (~scanf("%d%d%d",&n,&l,&r))
    {
        memset(dp,0x3f,sizeof(dp));//初始化为无穷大
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
            sum[i]=sum[i-1]+a[i];//前缀和
        }
        for(int i=1;i<=n;i++)//初始化dp
            for(int j=i;j<=n;j++)
                dp[i][j][j-i+1]=0;//[i,j]分成j-i+1堆的代价是0
        for(int len=2;len<=n;len++)
        {
            for(int i=1;i<=n-len+1;i++)
            {
                int j=i+len-1;
                for(int k=i;k<j;k++)//枚举分界点
                {
                    for(int t=l;t<=r;t++)//堆数
                        dp[i][j][1]=min(dp[i][j][1],dp[i][k][t-1]+dp[k+1][j][1]+sum[j]-sum[i-1]);
                    for(int t=2;t<j-i+1;t++)
                        dp[i][j][t]=min(dp[i][j][t],dp[i][k][t-1]+dp[k+1][j][1]);
                }

            }
        }
        int ans=dp[1][n][1];
        if(ans>=mx)
            printf("0
");
        else
            printf("%d
",ans);

    }
}