hihocoder1636-Pangu and Stones

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

输出

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.

样例输入

样例输出

9
6
0

题意：给你n个数字，每次只能将连续的l到r个数字合并，花费为合并数字的和，问最后将所有数字合为一个数字的最小花费

解题思路：区间dp，dp[i][j][k]表示以i为开头j为结尾的区间分为k份需要的最少花费，dp[i][j][k]=min(dp[i][j][k],dp[i][p][k-1]+dp[p+1][j][1])，dp[i][j][1]=dp[i][j][k]+sum[j]-sum[i-1](k>=l&&k<=r)

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <vector>
#include <bitset>
#include <functional>using namespace std;#define LL long long
const int INF = 0x3f3f3f3f;int n, l, r;
int a[109], dp[109][109][109], sum[109];int main()
{while (~scanf("%d%d%d", &n, &l, &r)){memset(dp, INF, sizeof dp);sum[0] = 0;for (int i = 1; i <= n; i++)scanf("%d", &a[i]), dp[i][i][1] = 0, sum[i] = sum[i-1] + a[i];for (int i = 2; i <= n; i++){for (int j = 1; j + i - 1 <= n; j++){for (int k = 2; k <= i; k++){for (int p = j; p <= j + i - 2; p++)dp[j][i + j - 1][k] = min(dp[j][j + i - 1][k], dp[j][p][k - 1] + dp[p + 1][j + i - 1][1]);if (k >= l&&k <= r) dp[j][j + i - 1][1] = min(dp[j][j + i - 1][1], dp[j][j + i - 1][k] + sum[j + i - 1] - sum[j - 1]);}}}if (dp[1][n][1] >= INF) dp[1][n][1] = 0;printf("%d\n", dp[1][n][1]);}return 0;
}

hihocoder1636-Pangu and Stones相关推荐

[ICPC 北京 2017 J题]HihoCoder 1636 Pangu and Stones
#1636 : Pangu and Stones 时间限制:1000ms 单点时限:1000ms 内存限制:256MB 描述 In Chinese mythology, Pangu is the fi ...
2017ICPC北京 J：Pangu and Stones（区间DP）
#1636 : Pangu and Stones 时间限制:1000ms 单点时限:1000ms 内存限制:256MB 描述 In Chinese mythology, Pangu is the fi ...
hihocoder 1636 Pangu and Stones
题目链接:Pangu and Stones 题目大意:给出n堆石头,每次最少合并其中l堆,最多合并r堆,合并的代价是这x堆的石头总和,问合成1堆最少需要多少代价题目思路:用 f[l][r][k] 表 ...
Pangu and Stones（区间 dp）
Pangu and Stones 状态转移方程 d[i][j][k] 代表 i 到 j 这段区间合并成 k 段的最小花费 k != 1 :dp[i][j][k] = min(dp[i][kk][[1] ...
icpc 2017北京 J题 Pangu and Stones 区间DP
#1636 : Pangu and Stones 时间限制:1000ms 单点时限:1000ms 内存限制:256MB 描述 In Chinese mythology, Pangu is the fi ...
Pangu and Stones HihoCoder - 1636 (区间DP) 2017区域赛北京站
Pangu and Stones 题目链接:HihoCoder - 1636 题意:现有n堆石子,每次合并k堆石子,L<=k<=R,每次合并石子花费代价是合并的石子的总数量:问最后能否合并 ...
Pangu and Stones 解题报告
题目: 描述 In Chinese mythology, Pangu is the first living being and the creator of the sky and the eart ...
2017 北京赛区 J题 Pangu and Stones 【区间DP】
题目链接:https://vjudge.net/problem/HihoCoder-1636: 题意:n堆石子,每次可以合并连续的 [ L~R ]堆石子,求最少的代价: /* 思路:区间DP;dp[i ...
Pangu and Stones（区间DP）
感受还是挺容易想到的区间DP,但是如果对区间DP理解不透彻可能会TLE还是挺容易想到的区间DP,但是如果对区间DP理解不透彻\\可能会TLE还是挺容易想到的区间DP,但是如果对区间DP理解不透彻可能 ...
区间dp(Pangu and Stones)
题意:给n堆石头,标号为1到n,每堆石头有一定的个数,每次可以选择[L,R]中任意一个数那么多堆来合并,每次合并的花费是合并后石头的的总个数,求花费的最小值思路:dp[i][j][p]代表把区间[i ...

hihocoder1636-Pangu and Stones

#1636 : Pangu and Stones

描述

输入

输出

hihocoder1636-Pangu and Stones相关推荐

最新文章

热门文章