poj2184 Cow Exhibition(01背包问题)

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

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头牛，每头牛有一个S值和一个F值，要求你选几头牛，得到一个S值的和TS，一个T值的和TF，求TS+TF的最大值，且TS和TF为非负。

思路：TS和TF的范围是[-100000,100000]，在TS一定时，求TF的最大值，做dp数组，下标是TS，值为TF，由于TS可能为负，所以做一下偏移。

参考代码：

#include<iostream>
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<string>
#include<cstring>
using namespace std;

typedef long long ll;

const int INF=0x3f3f3f3f;
const int NINF=0xc0c0c0c0;
const int MAX_N= 100+5;

int n;
int s[MAX_N],f[MAX_N];
int dp[200000+6];
int dt[200000+6];

void solve(){
    fill(dp,dp+200001,NINF);
    dp[100000]=0;
    for(int i=0;i<n;i++){
        fill(dt,dt+200001,NINF);
        for(int j=0;j<=200000;j++){
            if(dp[j]!=NINF){
                dt[j+s[i]]=dp[j]+f[i];
            }
        }
        for(int j=0;j<=200000;j++){
            dp[j]=max(dp[j],dt[j]);
        }
    }
    int res=0;
    for(int i=100000;i<=200000;i++){
        if(dp[i]>=0){
            res=max(res,dp[i]+i-100000);
        }
    }
    printf("%d\n",res);
}

int main(){
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        scanf("%d%d",s+i,f+i);
    }
    solve();
    return 0;
}