zoukankan      html  css  js  c++  java
  • 多重背包问题

    "Fat and docile, big and dumb, they look so stupid, they aren't much fun..." 
                                                                       - Cows with Guns by Dana Lyons 

    The cows want to prove to the public that they are both smart and fun. In order to do this, Bessie has organized an exhibition that will be put on by the cows.
    She has given each of the N (1 <= N <= 100) cows a thorough interview and determined two values for each cow:
    the smartness Si (-1000 <= Si <= 1000) of the cow and the funness Fi (-1000 <= Fi <= 1000) of the cow. 

    Bessie must choose which cows she wants to bring to her exhibition. She believes that the total smartness TS of the group is the sum of the Si's and, likewise,
    the total funness TF of the group is the sum of the Fi's. Bessie wants to maximize the sum of TS and TF,
    but she also wants both of these values to be non-negative (since she must also show that the cows are well-rounded;
    a negative TS or TF would ruin this). Help Bessie maximize the sum of TS and TF without letting either of these values become negative. 

    Input

    * Line 1: A single integer N, the number of cows 

    * Lines 2..N+1: Two space-separated integers Si and Fi, respectively the smartness and funness for each cow. 

    Output

    * Line 1: One integer: the optimal sum of TS and TF such that both TS and TF are non-negative. If no subset of the cows has non-negative TS and non- negative TF, print 0. 

    Sample Input

    5
    -5 7
    8 -6
    6 -3
    2 1
    -8 -5
    

    Sample Output

    8
    

    Hint

    OUTPUT DETAILS: 

    Bessie chooses cows 1, 3, and 4, giving values of TS = -5+6+2 = 3 and TF 
    = 7-3+1 = 5, so 3+5 = 8. Note that adding cow 2 would improve the value 
    of TS+TF to 10, but the new value of TF would be negative, so it is not 
    allowed. 
     
    题目意思:
    有n头牛,每头牛有自己的聪明值和幽默值,选出几头牛使得选出牛的聪明值总和大于0、幽默值总和大于0,求聪明值和幽默值总和相加最大为多少。
     
    http://www.cnblogs.com/qq1012662902/p/4649424.html
    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    #include <iostream>
    #include <set>
    using namespace std;
    #define N 200005
    #define sh 100000
    #define inf 999999999
    int dp[N];
    struct node{int v, w;}a[105];
    int n;
    int main()
    {
        int i, j, k;
        while(scanf("%d",&n)==1){
            for(i=0;i<n;i++) scanf("%d %d",&a[i].v,&a[i].w);
            for(i=0;i<N;i++) dp[i]=-inf;
            dp[sh]=0;
            for(i=0;i<n;i++){
                if(a[i].v>0) for(k=N-1;k>=a[i].v;k--) dp[k]=max(dp[k-a[i].v]+a[i].w,dp[k]);
                else for(k=0;k<N+a[i].v;k++) dp[k]=max(dp[k-a[i].v]+a[i].w,dp[k]);
            }
            int ans=0;
            for(i=sh;i<N;i++) if(dp[i]>0) ans=max(ans,i-sh+dp[i]);
            printf("%d
    ",ans);
        }
  • 相关阅读:
    许可和授权的研究及其破解
    Citect:How do I translate Citect error messages?
    异步IO模型和Overlapped结构
    SanDisk SecureAccess™ Software
    Asynchronous socket communication
    一种字节转字符串的语法
    【转载】C# Tutorial
    保存项目文件“XXX.csprj”时出错。类没有注册。
    markdown中的注释
    ubuntu上nginx详细安装部署教程
  • 原文地址:https://www.cnblogs.com/carry-2017/p/7360087.html
Copyright © 2011-2022 走看看