HihoCoder - 1636 Pangu and Stones 17北京

最新推荐文章于 2020-08-23 11:08:57 发布

mmk27

最新推荐文章于 2020-08-23 11:08:57 发布

阅读量116

点赞数

本文链接：https://blog.csdn.net/mmk27_word/article/details/83446227

版权

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

Sample Output

9
6
0

题解： dp[i][j][k] 表示从i到j 目前为k堆的最小花费

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
#define INF 0x3f3f3f3f
const int N=110;
int n,dp[N][N][N],sum[N];
int l,r;
int main()
{
	int x;
	while(~scanf("%d%d%d",&n,&l,&r))
	{
		memset(dp,INF,sizeof(dp));
		for(int i=1;i<=n;i++)
		{
			scanf("%d",&x);
			sum[i]=sum[i-1]+x;
			dp[i][i][1]=0;
		}	
		for(int len=1;len<=n;len++)// 枚举长度
		{
			for(int i=1;i+len-1<=n;i++)//枚举起点
			{
				int j=i+len-1;
				for(int k=2;k<=min(len,r);k++)//枚举区间可以由多少堆得来
				{
					for(int p=i;p<j&&j-p>=k-1;p++) // 枚举第一堆的位置
					{
						dp[i][j][k]=min(dp[i][j][k],dp[i][p][1]+dp[p+1][j][k-1]);
					}
					if(k>=l&&k<=r) 
						dp[i][j][1]=min(dp[i][j][1],dp[i][j][k]+sum[j]-sum[i-1]);
				}	
			}	
		}	
		if(dp[1][n][1]==INF) dp[1][n][1]=0;
		printf("%d\n",dp[1][n][1]);
	}	
	return 0;
}