2017 北京区域赛J Pangu and Stones（石子合并升级版 区间dp）

Pangu and Stones

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'.

Input

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 a1,a2 …aN (1<= ai  <=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.

Output

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.

Sample Input

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

Sample Output

9
6
0

题意：给你n个数字，每次合并L-R范围的数字计分，求最小的分数，如果不能完全划分就输出0.

思路：显然这是一个合并石子问题的升级版，由两个石子变成了k个石子。所以我们采取区间dp的时候需要改变一下区间范围。

#include<bits/stdc++.h>
using namespace std;
const int N = 107;
const int inf = 0x3f3f3f3f;
int dp[N][N][N];
int w[N];
int main () {
    int n,L,R,pos;
    while(scanf("%d%d%d",&n,&L,&R) != EOF){
        for(int i = 0;i < N;++i)
            for(int j = 0;j < N;++j)
                for(int k = 0;k < N;++k) dp[i][j][k] = inf;
        for(int i = 1;i <= n;++i){
            scanf("%d",&w[i]);
            w[i] += w[i - 1];
        }
        for(int len = 1;len <= n;++len){
            for(int i = 1,j = len;j <= n;++i,++j){
                dp[i][j][len] = 0;
                for(int k = 2;k <= len;++k){
                    for(int p = i;p <= j;++p) dp[i][j][k] = min(dp[i][j][k],dp[i][p][1] + dp[p + 1][j][k - 1]);
                    if(k <= R && k >= L) dp[i][j][1] = min(dp[i][j][1],dp[i][j][k] + w[j] - w[i - 1]);
                }
            }
        }
        if(dp[1][n][1] == inf) printf("0\n");
        else printf("%d\n",dp[1][n][1]);
    }
    return 0;
}