uva10130 - SuperSale（dp 0-1背包问题）

题目大意是一家人去超市抢购， 每个人的能力有限，问全家一共能搬走多少价值最大的东西

 

就是对每个人做一次01背包。累加总和。。 注意给数组初始化只需要 0 那一行

 

 

 

题目：

SuperSale

There is a SuperSale in a SuperHiperMarket. Every person can take only one object of each kind, i.e. one TV, one carrot, but for extra low price. We are going with a whole family to that SuperHiperMarket. Every person can take as many objects, as he/she can carry out from the SuperSale. We have given list of objects with prices and their weight. We also know, what is the maximum weight that every person can stand. What is the maximal value of objects we can buy at SuperSale?

Input Specification

The input consists of T test cases. The number of them (1<=T<=1000) is given on the first line of the input file.

Each test case begins with a line containing a single integer number N that indicates the number of objects (1 <= N <= 1000). Then follows N lines, each containing two integers: P and W. The first integer (1<=P<=100) corresponds to the price of object. The second  integer (1<=W<=30) corresponds to the weight of object. Next line contains one integer (1<=G<=100)  it’s the number of people in our group. Next G lines contains maximal weight (1<=MW<=30) that can stand this i-th person from our family (1<=i<=G).

Output Specification

For every test case your program has to determine one integer. Print out the maximal value of goods which we can buy with that family.

Sample Input

2

3

72 17

44 23

31 24

1

26

6

64 26

85 22

52 4

99 18

39 13

54 9

4

23

20

20

26

 

Output for the Sample Input

72

514

 

 

代码：

//Wed Jan  1 16:34:55 2014
//Author:Minshik
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <memory.h>
#include <cctype>
using namespace std;

const int maxn = 1000+10;
int N,G;
int P[maxn];
int W[maxn];
int Cap[maxn];
int F[maxn][maxn];
int input()
{
    cin>>N;
    for(int i=1;i<=N;i++){cin>>P[i];cin>>W[i];}
    cin>>G;
    int tmp;
    for(int i=0;i<G;i++){cin>>Cap[i];}
    return 0;
}
int main()
{
    int tst;
    cin>>tst;
    while(tst--)
    {
        input();

        int AAA=0;
        for(int k=0;k<G;k++)
        {
            for(int i=1;i<=N;i++)
            {
                for(int v=0;v<=Cap[k];v++)
                {
                    if(v>=W[i])
                    F[i][v] = max( F[i-1][v], F[i-1][v-W[i]]+P[i]);
                    else
                        F[i][v] = F[i-1][v];
                }
            }

            AAA+=F[N][Cap[k] ];
            for(int i=0;i<=Cap[k];i++)
                F[0][i]=0;
        }
        cout<<AAA<<endl;
    }


    return 0;
}

 

 

 

空间优化

//Wed Jan  1 16:34:55 2014
//Author:Minshik
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <memory.h>
#include <cctype>
using namespace std;

const int maxn = 1000+10;
int N,G;
int P[maxn];
int W[maxn];
int Cap[maxn];
int F[maxn];
int input()
{
    cin>>N;
    for(int i=1;i<=N;i++){cin>>P[i];cin>>W[i];}
    cin>>G;
    int tmp;
    for(int i=0;i<G;i++){cin>>Cap[i];}
    return 0;
}
int main()
{
    int tst;
    cin>>tst;
    while(tst--)
    {
        input();

        int AAA=0;
        for(int k=0;k<G;k++)
        {
            for(int i=1;i<=N;i++)
            {
                for(int v=Cap[k];v>=W[i];v--)
                {
                    if(v>=W[i])
                        F[v] = max( F[v], F[v-W[i]]+P[i]);
                }
            }

            AAA+=F[Cap[k] ];
            for(int i=0;i<=Cap[k];i++)
                F[i]=0;
        }
        cout<<AAA<<endl;
    }


    return 0;
}