zoukankan      html  css  js  c++  java
  • Cow Exhibition 变种背包

    Cow Exhibition
    Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u
    Submit Status

    Description

    "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

     1 #include <iostream>
     2 #include <stdio.h>
     3 #include <string.h>
     4 #include <map>
     5 using namespace std;
     6 #define ben 110000
     7 #define INF -999999999
     8 typedef struct abcd
     9 {
    10     int s,f;
    11 }abcd;
    12 abcd a[200];
    13 int dp[200000];
    14 int main()
    15 {
    16     int n,i,j;
    17     scanf("%d",&n);
    18     for(i=0;i<n;i++)
    19     {
    20         scanf("%d%d",&a[i].s,&a[i].f);
    21     }
    22     for(i=0;i<200000;i++)dp[i]=INF;
    23     dp[ben]=0;
    24     for(i=0;i<n;i++)
    25     {
    26         if(a[i].s>=0)
    27         {
    28             for(j=200000-1;j-a[i].s>=0;j--)
    29             dp[j]=max(dp[j-a[i].s]+a[i].f,dp[j]);
    30         }
    31         else
    32         {
    33             for(j=0;j-a[i].s<200000;j++)
    34             dp[j]=max(dp[j-a[i].s]+a[i].f,dp[j]);
    35         }
    36     }
    37     int ans=0;
    38     for(i=ben;i<200000;i++)
    39     if(dp[i]>=0)
    40     ans=max(ans,dp[i]+i-ben);
    41     cout<<ans<<endl;
    42 }
    View Code
  • 相关阅读:
    关于pandas里面的合并
    关于动态规划的一丢丢研究
    结巴分词详细讲解
    k折交叉验证
    Boosting和Bagging的异同
    批量归一化的原理
    深度学习模型参数初始化的方法
    NLP 装桶(Bucketing)和填充(padding)
    facebook 摘要生成阅读笔记(二) Abstractive Sentence Summarization with Attentive Recurrent Neural Networks
    facebook 摘要生成阅读笔记(一) A Neural Attention Model for Sentence Summarization
  • 原文地址:https://www.cnblogs.com/ERKE/p/3841691.html
Copyright © 2011-2022 走看看