poj-3628

原创 2013年12月02日 21:03:03
Bookshelf 2
Time Limit: 1000MS   Memory Limit: 65536K
Total Submissions: 6865   Accepted: 3166

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 Hi (1 ≤ Hi ≤ 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: Hi

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

5 16
3
1
3
5
6

Sample Output

1

Source



01背包
#include <iostream>
#define maxv 1000005
using namespace std;
int ans[maxv],n,v,c[21],sum;
int main()
{
    cin>>n>>v;
    for(int i=1; i<=n; i++){
        cin>>c[i];
        sum += c[i];
    }
    
    for(int i=1; i<=n; i++){
        for(int j=sum; j>=c[i]; j--){
            if(ans[j]<ans[j-c[i]]+c[i])
                ans[j]=ans[j-c[i]]+c[i];
        }
    }
    
    for(int i=v; i<=sum; i++){
        if(i==ans[i]){
            cout<<ans[i]-v<<endl;
            break;
        }
    }
    return 0;
}


DFS,别人写的,没看懂。
/* Author : yan
 * Question : POJ 3628 Bookshelf 2
 * Data && Time : Wednesday, December 22 2010 11:34 PM
*/
#include<stdio.h>
using namespace std;
int cow[20];
int b;
int n;
int ans=99999999;
void DFS(int num,int sum)
{
	if(sum>=ans) return;
	if(num==n)
	{
		if(sum>=b) ans=sum;
		return;
	}
	DFS(num+1,sum);
	DFS(num+1,sum+cow[num]);
}
int main()
{
	//freopen("input","r",stdin);
	int i,j,cnt,tmp;
	int sum;
	scanf("%d %d",&n,&b);
	for(i=0;i<n;i++)
		scanf("%d",&cow[i]);
	DFS(0,0);
	printf("%d",ans-b);
	return 0;
}





版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

poj 3628 Bookshelf 2 01背包

Bookshelf 2 Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 7167   Ac...

POJ3628 Bookshelf 2(01背包)

题意: 你要很多不同高度的奶牛,想要达到一个高度为b的书架,将奶牛一个个叠起来,要求奶牛的高度和大于b,输出大于b且最小的高度和 要点: 将所有奶牛高度都加起来减去b的值作为背包大小,这样便转化...

POJ 3628 Bookshelf 2(状态压缩DP+位运算)

Farmer John recently bought another bookshelf for the cow library, but the shelf is getting filled u...

POJ 3628 Bookshelf 2 (01背包)

POJ 3628 Bookshelf 2 (01背包) 题意:就是给出n和b,然后给出n个数,用这n个数中的某些,求出一个和,这个和是>=b的最小值,输出最小值与b的差。

poj 3628 Bookshelf 2(01背包,dfs)

Description Farmer John recently bought another bookshelf for the cow library, but the shelf is get...

POJ 3628 Bookshelf 2 0/1背包和DFS两种解法

POJ 3628 Bookshelf 2 0/1背包和DFS两种解法

【POJ 3628】Bookshelf 2(01背包)

DescriptionFarmer John recently bought another bookshelf for the cow library, but the shelf is getti...

poj 3628 Bookshelf 2(01背包入门或者dfs)

Bookshelf 2 Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 4064   Ac...
  • fp_hzq
  • fp_hzq
  • 2011-09-29 11:21
  • 1351

poj-3628 Silver Cow Party

题目链接:http://poj.org/problem?id=3268 所有的牛去一个牛的家里参加聚会,所给的路径是单向的,问往返的所有牛的路径长度中最长的是多少? 解法:往返时候翻转矩阵,再求一...

poj3628 Bookshelf 2(0/背包)

题意:就是给出n和b,然后给出n个数,用这n个数中的某些,求出一个和,这个和是>=b的最小值,输出最小值与b的差。 分析:这道题很简单,是很明显的01背包问题,这里的n个物品,每个物品的重量为c[i...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)