首页 > 代码库 > poj 2184

poj 2184

2024-11-04 00:45:41   205人阅读

Cow Exhibition
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 9530 Accepted: 3673

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 78 -66 -32 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. 

Source

USACO 2003 Fall
#include<iostream>#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<cstdlib>#include<algorithm>using namespace std;const int N = 110;const int M = 200010;const int NN = 1000;const int INF = 10000000;int w[N],v[N],sum;int dp[M], cnt[M];int main(){    int n,ans;    int i,j;    while(~scanf("%d", &n))    {        sum = 0;        for(i = 1; i <= n; i++)        {            scanf("%d%d", v+i, w+i);            if(w[i] <= 0 && v[i] <= 0) {i--,n--; continue;}            v[i] += 1000;            sum += v[i];        }        for(i = 1; i <= sum; dp[i++] = -INF);        dp[0] = 0;        memset(cnt, 0, sizeof(cnt));        for(i = 1; i <= n; i++)            for(int j = sum; j >= v[i]; j--)                if(dp[j-v[i]]+w[i]-(cnt[j-v[i]]+1)*NN > dp[j]-cnt[j]*NN)                {                    dp[j] = dp[j-v[i]]+w[i];                    cnt[j] = cnt[j-v[i]]+1;                }        ans = 0;        for(i = 0; i <= sum; i++)            if(dp[i] >= 0 && i-cnt[i]*NN >= 0)                ans = max(ans, dp[i]+i-cnt[i]*NN);        printf("%d\n", ans);    }    return 0;}

　　

poj 2184


联系
我们