zoukankan      html  css  js  c++  java
  • uva10130

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

    就是对每个人做一次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

    代码:

     1 //Wed Jan  1 16:34:55 2014
     2 //Author:Minshik
     3 #include <iostream>
     4 #include <algorithm>
     5 #include <cstring>
     6 #include <cstdio>
     7 #include <string>
     8 #include <vector>
     9 #include <set>
    10 #include <stack>
    11 #include <queue>
    12 #include <deque>
    13 #include <memory.h>
    14 #include <cctype>
    15 using namespace std;
    16 
    17 const int maxn = 1000+10;
    18 int N,G;
    19 int P[maxn];
    20 int W[maxn];
    21 int Cap[maxn];
    22 int F[maxn][maxn];
    23 int input()
    24 {
    25     cin>>N;
    26     for(int i=1;i<=N;i++){cin>>P[i];cin>>W[i];}
    27     cin>>G;
    28     int tmp;
    29     for(int i=0;i<G;i++){cin>>Cap[i];}
    30     return 0;
    31 }
    32 int main()
    33 {
    34     int tst;
    35     cin>>tst;
    36     while(tst--)
    37     {
    38         input();
    39 
    40         int AAA=0;
    41         for(int k=0;k<G;k++)
    42         {
    43             for(int i=1;i<=N;i++)
    44             {
    45                 for(int v=0;v<=Cap[k];v++)
    46                 {
    47                     if(v>=W[i])
    48                     F[i][v] = max( F[i-1][v], F[i-1][v-W[i]]+P[i]);
    49                     else
    50                         F[i][v] = F[i-1][v];
    51                 }
    52             }
    53 
    54             AAA+=F[N][Cap[k] ];
    55             for(int i=0;i<=Cap[k];i++)
    56                 F[0][i]=0;
    57         }
    58         cout<<AAA<<endl;
    59     }
    60 
    61 
    62     return 0;
    63 }
    View Code

    空间优化

     1 //Wed Jan  1 16:34:55 2014
     2 //Author:Minshik
     3 #include <iostream>
     4 #include <algorithm>
     5 #include <cstring>
     6 #include <cstdio>
     7 #include <string>
     8 #include <vector>
     9 #include <set>
    10 #include <stack>
    11 #include <queue>
    12 #include <deque>
    13 #include <memory.h>
    14 #include <cctype>
    15 using namespace std;
    16 
    17 const int maxn = 1000+10;
    18 int N,G;
    19 int P[maxn];
    20 int W[maxn];
    21 int Cap[maxn];
    22 int F[maxn];
    23 int input()
    24 {
    25     cin>>N;
    26     for(int i=1;i<=N;i++){cin>>P[i];cin>>W[i];}
    27     cin>>G;
    28     int tmp;
    29     for(int i=0;i<G;i++){cin>>Cap[i];}
    30     return 0;
    31 }
    32 int main()
    33 {
    34     int tst;
    35     cin>>tst;
    36     while(tst--)
    37     {
    38         input();
    39 
    40         int AAA=0;
    41         for(int k=0;k<G;k++)
    42         {
    43             for(int i=1;i<=N;i++)
    44             {
    45                 for(int v=Cap[k];v>=W[i];v--)
    46                 {
    47                     if(v>=W[i])
    48                         F[v] = max( F[v], F[v-W[i]]+P[i]);
    49                 }
    50             }
    51 
    52             AAA+=F[Cap[k] ];
    53             for(int i=0;i<=Cap[k];i++)
    54                 F[i]=0;
    55         }
    56         cout<<AAA<<endl;
    57     }
    58 
    59 
    60     return 0;
    61 }
    View Code
  • 相关阅读:
    关于Hyper-V备份的四大注意事项
    未找到导入的项目,请确认 <Import> 声明中的路径正确
    IDC门外汉-单线、双线、智能多线、BGP的区别
    国内主流云主机比较
    Error : The specified component was not reported by the VSS writer (Error 517) in Windows Server 2012 Backup
    [MSDN] Windows Server 2012 R2 简/繁/英下载
    深入浅出VC++串口编程之基于Win32 API
    Remon Spekreijse CSerialPort串口类的修正版2014-01-10
    Remon Spekreijse CSerialPort用法
    “CObject::operator =”: 无法访问 private 成员(在“CObject”类中声明)
  • 原文地址:https://www.cnblogs.com/doubleshik/p/3500754.html
Copyright © 2011-2022 走看看