背包问题
The Dark Kinght
一天天的都不知道自己在干嘛
展开
-
HDU2082
找单词Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3533 Accepted Submission(s): 2536Problem Description假设有x1个字母A, x2个字母B,..... x2原创 2014-02-28 11:56:20 · 480 阅读 · 0 评论 -
hdu1114
Piggy-BankTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10149 Accepted Submission(s): 5113Problem DescriptionBefore ACM can do原创 2014-04-08 21:30:42 · 819 阅读 · 0 评论 -
hdu3466 Proud Merchants
点击打开链接原创 2014-05-10 18:13:27 · 427 阅读 · 0 评论 -
poj2923 Relocation(压缩dp+01背包)
DescriptionEmma and Eric are moving to their new house they bought after returning from their honeymoon. Fortunately, they have a few friends helping them relocate. To move the furniture, they o原创 2014-05-10 15:21:49 · 406 阅读 · 0 评论 -
hdu 2126 Buy the souvenirs(求方案数的背包)
Problem DescriptionWhen the winter holiday comes, a lot of people will have a trip. Generally, there are a lot of souvenirs to sell, and sometimes the travelers will buy some ones with pleasure. Not原创 2014-05-10 21:19:38 · 503 阅读 · 0 评论 -
uva674(完全背包)
题意:有5种硬币1,5,10,25,50,;现在原创 2014-05-11 17:28:24 · 515 阅读 · 0 评论 -
poj3260(多重背包+完全背包)
DescriptionFarmer John has gone to town to buy some farm supplies. Being a very efficient man, he always pays for his goods in such a way that the smallest number of coins changes hands, i.e., t原创 2014-05-12 17:45:57 · 559 阅读 · 0 评论 -
poj1787 Charlie's Change
DescriptionCharlie is a driver of Advanced Cargo Movement, Ltd. Charlie drives a lot and so he often buys coffee at coffee vending machines at motorests. Charlie hates change. That is basically th原创 2014-05-12 10:22:37 · 400 阅读 · 0 评论 -
hdu3496(二维背包)
Watch The MovieTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 5035 Accepted Submission(s): 1588Problem DescriptionNew semester i原创 2014-04-12 11:20:10 · 389 阅读 · 0 评论 -
hdu1059(多重背包)
InputEach line in the input describes one collection of marbles to be divided. The lines consist of six non-negative integers n1, n2, ..., n6, where ni is the number of marbles of value i. So, the e原创 2014-04-12 20:42:25 · 392 阅读 · 0 评论 -
csu1086(超市购物)(分组背包)
1086: 超市购物Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 203 Solved: 84[Submit][Status][Web Board]Description 上次去超市扫荡回来的东西用完了,Staginner又得跑超市一趟,出发前他列了一张购物清单,打算去买K种不同的商品,每种买一件。到了原创 2014-04-06 17:45:22 · 641 阅读 · 0 评论 -
二维背包(hdu2159)
问题二维费用的背包问题是指:对于每件物品,具有两种不同的费用;选择这件物品必须同时付出这两种代价;对于每种代价都有一个可付出的最大值(背包容量)。问怎样选择物品可以得到最大的价值。设这两种代价分别为代价1和代价2,第i件物品所需的两种代价分别为a[i]和b[i]。两种代价可付出的最大值(两种背包容量)分别为V和U。物品的价值为w[i]。算法费用加了一维,只需状态也加一维即可。设f[i]原创 2014-04-08 19:26:13 · 376 阅读 · 0 评论 -
hdu1712
ACboy needs your helpTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3646 Accepted Submission(s): 1892Problem DescriptionACboy ha原创 2014-04-09 20:11:01 · 379 阅读 · 0 评论 -
HDU2079
选课时间(题目已修改,注意读题)Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2558 Accepted Submission(s): 2032Problem Description又到了选课的时间了,xhd转载 2014-02-28 11:48:36 · 498 阅读 · 0 评论 -
nyoj49(01背包)
#include #include#include#include#include#include#includeusing namespace std;#define Max(a,b) a>b?a:b#define Min(a,b) aint dp[30010],val[110],wei[110];int main(){ int t;原创 2014-04-16 19:31:30 · 389 阅读 · 0 评论 -
nyoj61(双线背包)
第一次遇到这种背包问题,看原创 2014-04-16 21:25:09 · 464 阅读 · 0 评论 -
nyoj311
#include#include#include#include#include#includeusing namespace std;#define Max(a,b) a>b?a:bint a[2050],v[2050],dp[50050];int main(){ int t; cin>>t; while(t--) { i原创 2014-05-06 10:59:12 · 367 阅读 · 0 评论 -
hdu2955(01背包)
RobberiesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10016 Accepted Submission(s): 3723Problem DescriptionThe aspiring Roy th原创 2014-04-07 15:49:13 · 391 阅读 · 0 评论 -
hdu2191(多重背包)
悼念512汶川大地震遇难同胞——珍惜现在,感恩生活Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12911 Accepted Submission(s): 5441Problem Description急!灾原创 2014-04-07 21:38:28 · 476 阅读 · 0 评论 -
背包问题1(01背包)
背包问题(01背包)以下原创 2014-04-06 10:20:02 · 502 阅读 · 0 评论 -
背包问题3(多重背包)
基于上次说的01背包和原创 2014-04-07 17:51:18 · 450 阅读 · 0 评论 -
背包问题2(完全背包)
问题的提出:有原创 2014-04-07 09:44:03 · 513 阅读 · 0 评论 -
hdu1203(01背包)
I NEED A OFFER!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14726 Accepted Submission(s): 5767Problem DescriptionSpeakless很早就想原创 2014-04-07 17:31:51 · 393 阅读 · 0 评论 -
hdu1963(完全背包)
SubmitStatusDescriptionJohn never knew he had a grand-uncle, until he received the notary's letter. He learned that his late grand-uncle had gathered a lot of money, somewhere in South-Ameri原创 2014-05-12 20:47:43 · 483 阅读 · 0 评论