POJ 3268 Bookshelf 2 动态规划法题解

Description

Farmer John recently bought another bookshelf for the cow library, but the shelf is getting filled up quite quickly, and now the only available space is at the top.

FJ has N cows (1 ≤ N ≤ 20) each with some height of H_i (1 ≤ H_i ≤ 1,000,000 - these are very tall cows). The bookshelf has a height of B (1 ≤ B ≤ S, where S is the sum of the heights of all cows).

To reach the top of the bookshelf, one or more of the cows can stand on top of each other in a stack, so that their total height is the sum of each of their individual heights. This total height must be no less than the height of the bookshelf in order for the cows to reach the top.

Since a taller stack of cows than necessary can be dangerous, your job is to find the set of cows that produces a stack of the smallest height possible such that the stack can reach the bookshelf. Your program should print the minimal 'excess' height between the optimal stack of cows and the bookshelf.

Input

* Line 1: Two space-separated integers: N and B
* Lines 2..N+1: Line i+1 contains a single integer: H_i

Output

* Line 1: A single integer representing the (non-negative) difference between the total height of the optimal set of cows and the height of the shelf.

Sample Input

Sample Output

Source

USACO 2007 December Bronze

解题思路：

1 确定可能的最大高度sum，就是全部的cow加起来的高度

2 依据动态规划法。求解1到最大高度sum之间的可能解

3 找到比B（书架高度）的最低高度，可能和B一致。

#include <stdio.h>
#include <vector>
#include <limits.h>
#include <string.h>
#include <algorithm>
using namespace std;const int MAX_N = 21, MAX_H = 1000000;
int cow[MAX_N];
bool height[MAX_N*MAX_H];int getMinHeight(int N, int B, int sum)//B < sum
{fill(height, height+sum+1, false);height[0] = true;for (int i = 0; i < N; i++){for (int j = sum; j >= cow[i]; j--){if (height[j-cow[i]]) height[j] = true;}}int ans = B;for (; ans <= sum && !height[ans]; ans++) {}return ans;
}int main()
{int N, B, sum;while (~scanf("%d %d", &N, &B)){sum = 0;for (int i = 0; i < N; i++){scanf("%d", cow+i);sum += cow[i];}printf("%d\n", getMinHeight(N, B, sum)-B);}return 0;
}

POJ 3268 Bookshelf 2 动态规划法题解相关推荐

D - Silver Cow Party POJ - 3268
D - Silver Cow Party POJ - 3268 dijkstra 是 O(n2),堆优化一下, O(nlogn) 对每个点跑一次 dj, 取 max(dis(x->i)+dis( ...
POJ 3628 Bookshelf 2
POJ 3628 Bookshelf 2:http://poj.org/problem?id=3628 题意:有个书架,高度为B,现在FJ有N个奶牛,每个奶牛有个高度hi,现在将奶牛堆起来,使得堆起来 ...
POJ 3735 Training little cats 题解《挑战程序设计竞赛》
为什么80%的码农都做不了架构师?>>> POJ 3735 Training little cats调教猫咪:有n只饥渴的猫咪,现有一组羞耻Play,由k个操作组成,全部选自: ...
POJ 3268 Silver Cow Party （最短路径）
POJ 3268 Silver Cow Party (最短路径) Description One cow from each of N farms (1 ≤ N ≤ 1000) convenientl ...
POJ 魔兽世界之一：备战题解
POJ 魔兽世界之一:备战题解来源: POJ 注意: 总时间限制: 1000ms 内存限制: 65536kB 描述魔兽世界的西面是红魔军的司令部,东面是蓝魔军的司令部.两个司令部之间是依次排列的 ...
POJ 1061青蛙的约会题解
POJ 1061青蛙的约会题解网上似乎有不少此题的解法.我这个post和其他人的相比主要时想说下面几点. 1. 给出一个试图不死记硬背公式的思路; 2. 谈谈暴力解为什么看起来这么诱人,却无法通过; ...
Silver Cow Party （POJ - 3268 ）
Silver Cow Party (POJ - 3268 ) 这道题是我做的最短路专题里的一道题,但我还没做这个,结果比赛就出了,真是.......... 题目: One cow from each ...
POJ 3268 D-Silver Cow Party
http://poj.org/problem?id=3268 Description One cow from each of N farms (1 ≤ N ≤ 1000) conveniently ...
poj 3682 Bookshelf 2——背包问题（dfs）
Bookshelf 2 Description Farmer John recently bought another bookshelf for the cow library, but the s ...

POJ 3268 Bookshelf 2 动态规划法题解

POJ 3268 Bookshelf 2 动态规划法题解相关推荐

最新文章

热门文章