POJ2184 --- Cow Exhibition (01 backpack deformation)

POJ2184 --- Cow Exhibition (01 backpack deformation)

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 wowould 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 wocould improve the value
Of TS + TF to 10, but the new value of TF wocould be negative, so it is not
Allowed.

Source
USACO 2003 Fall

This can be done directly with a 01 backpack. Note that the volume may be negative.

/*************************************** * *********************************> File Name: POJ2184.cpp> Author: ALex> Mail: zchao1995@gmail.com> Created Time: ******************************** **************************************** /# include
  
   
# Include
   
    
# Include
    
     
# Include
     
      
# Include
      
        # Include
       
         # Include
        
          # Include
         
           # Include
          
            # Include
           # Include
            
              # Include
             
               # Include
              
                Using namespace std; const double pi = acos (-1.0); const int inf = 0x3f3f3f; const double eps = 1e-15; typedef long LL; typedef pair
               
                 PLL; static const int N = 100100; int dp [N <2]; int a [110], B [110]; int main () {int n; while (~ Scanf ("% d", & n) {memset (dp,-inf, sizeof (dp); dp [100000] = 0; for (int I = 1; I <= n; ++ I) {scanf ("% d", & a [I], & B [I]) ;}for (int I = 1; I <= n; ++ I) {if (a [I]> = 0) {for (int j = 200000; j> = a [I]; -- j) {if (dp [j-a [I]! =-Inf) {dp [j] = max (dp [j], dp [j-a [I] + B [I]) ;}} else {for (int j = 0; j <= 200000; ++ j) {if (dp [j-a [I]! =-Inf) {dp [j] = max (dp [j], dp [j-a [I] + B [I]) ;}}} int ans = 0; for (int j = 100001; j <= 200000; ++ j) {if (dp [j]! =-Inf & dp [j]> 0) {ans = max (ans, j + dp [j]-100000) ;}} printf ("% d \ n ", ans);} return 0 ;}