背包问题类型各题总结acm.docVIP

分组背包： Problem C: 超市购物 Time Limit: 1 Sec??Memory Limit: 128 MBSUBMIT: 21??Solved: 10[SUBMIT][STATUS] Description ? ? ? ? 上次去超市扫荡回来的东西用完了,Staginner又得跑超市一趟，出发前他列了一张购物清单，打算去买K种不同的商品,每种买一件。到了超市，Staginner发现每种商品有N个品牌，每个品牌此商品的价格为Vi，对Staginner的作用值为Wi，他会从这N个品牌里面挑一个品牌买。这时，Staginner突然想起出门时只带了M元钱，又懒得去取钱了，所以不一定能买完K种商品，只好尽可能地让买的东西对自己的总作用值ans最大。 Input ?多组样例。 ? ? 第一行两个整数K，M代表Staginner想买的不同种类商品的数目和他带的钱 (0 K = 30, 0 M = 2000) ? ? 以下输入分为K个部分，代表K种商品。 ? ? 每个部分第一行为一个数字N，代表第k种商品的N个品牌,N不大于10。之后跟着N行，每行两个数字，代表物品的价格Vi和作用值Wi。其中 0 Vi M。 Output ?输出Case #: 最大总作用值，每两个样例之间有一个空行。 Sample Input 3 100350 60020 70030 800??230 50040 600?160 200 2 5002200 1000260 12001280 300 Sample Output Case 1: 1400 Case 2: 1300 HINT ? #includestdio.h#includestring.hint bag[100][100],dp[2500],val[100][100];int main(){?int k,m,n,i,j,t,cnt=0;?while(scanf(%d %d,t,m)!=EOF)?{??memset(dp,0,sizeof(dp));??memset(val,0,sizeof(val));??memset(bag,0,sizeof(bag));??for(i=0;it;i++)??{???????????? scanf(%d,n);??? bag[i][0]=n;??? for(j=1;j=n;j++)???? scanf(%d %d,bag[i][j],val[i][j]);??}??? for(i=0;it;i++)???? for(j=m;j=0;j--)????? for(k=1;k=bag[i][0];++k)?????? if(bag[i][k]=j)?????? dp[j]=dp[j](dp[j-bag[i][k]]+val[i][k])?dp[j]:(dp[j-bag[i][k]]+val[i][k]);???????? printf(Case %d: %d\n,++cnt,dp[m]);?? printf(\n);?}?return 0;} Robberies Time Limit: 2000/1000 MS (Java/Others)????Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3802????Accepted Submission(s): 1433 Problem Description The aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually gets caught in the end, often because they become too greedy. He has decided to work in the lucrative business of bank robbery only for a short while, before retiring to a comfortable job at a university. ? For a few months now, Roy has been assessing the security of various banks and the amount of cash they hold. He wants to make a calculated risk, and grab as much money as possible.His mother, Ola