# FZU 2214 Knapsack problem （超大容量背包）

Description Given a set of n items, each with a weight w[i] and a value v[i], determine a way to choose the items into a knapsack so that the total...

# Codeforces 862 E. Fire （01背包）

Description Polycarp is in really serious trouble — his house is on fire! It’s time to save the most valuable items. Polycarp estimated that it wou...

# POJ 1837 Balance (01背包)

Description Gigel has a strange “balance” and he wants to poise it. Actually, the device is different from any other ordinary balance. It ord...

# POJ 1276 Cash Machine (多重背包)

Description A Bank plans to install a machine for cash withdrawal. The machine is able to deliver appropriate @ bills for a requested cash amount. ...

# HDU 2955：Robberies （01背包）

Robberies Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 20669    Accepted Submission(s):...

# HDU 1114：Piggy-Bank

Piggy-Bank Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 20954    Accepted Submission(s): ...

# SDUT 2408:Pick apples

Pick apples Time Limit: 1000MS Memory limit: 165536K 题目描述 Once ago, there is a mystery yard which only produces three kinds of apples. The number...

个人资料
等级：
访问量： 36万+
积分： 1万+
排名： 2006
欢迎关注 <千与梦随> 哦！
博客专栏
 那些年,我们一起追过的算法 文章：6篇 阅读：23959
最新评论