【poj2184】【Cow Exhibition】
来源:互联网 发布:静态路由协议端口号 编辑:程序博客网 时间:2024/06/05 17:55
Cow Exhibition
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10255 Accepted: 4006
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.
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.
* 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.
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
注意两点:
1. 位移
2. 负值带来的只取一次的方向的改变。。。 可以更加深刻地理解什么是 只取一次。。。 还好上次就已经思考过这个问题啦~~~
#include <iostream>#include <cstring>#include <cmath>#include <queue>#include <stack>#include <list>#include <map>#include <set>#include <string>#include <cstdlib>#include <cstdio>#include <algorithm>using namespace std; int T;const int maxn = 110;const int maxv = 2*1e5 + 10;const int INF = 0x3f3f3f3f;int s[maxn];int t[maxn];int dp[maxv];int org;int main(){ org = 1e5; while(scanf("%d",&T) != EOF){for(int i=0;i<T;i++){scanf("%d%d",&s[i],&t[i]);}for(int i=0;i<=2*1e5;i++){dp[i] = -INF;}dp[org] = 0;for(int i=0;i<T;i++){if(s[i] >= 0){for(int j=2*1e5;j>=s[i];j--){dp[j] = max(dp[j], dp[j-s[i]] + t[i]);}}else{for(int j=0;j-s[i] <= 2*1e5;j++){dp[j] = max(dp[j],dp[j-s[i]] + t[i]);}}}int ans = -1;for(int i=1e5;i<=2*1e5;i++){if(dp[i] >= 0 && dp[i] + i - 1e5> ans){ans = dp[i] + i - 1e5;}}printf("%d\n",ans);} return 0;}
0 0
- POJ2184-Cow Exhibition
- poj2184 Cow Exhibition
- poj2184:cow exhibition
- poj2184 Cow Exhibition
- 【POJ2184】Cow Exhibition
- poj2184 Cow Exhibition
- 【poj2184】【Cow Exhibition】
- POJ2184--Cow Exhibition
- POJ2184-Cow Exhibition
- POJ2184 Cow Exhibition
- POJ2184 Cow Exhibition 动态规划
- 【POJ2184】Cow Exhibition 01背包
- POJ2184 Cow Exhibition 【01背包】
- poj2184 Cow Exhibition 01背包 变形
- POJ2184:Cow Exhibition(变种01背包)
- POJ2184---Cow Exhibition(01背包变形)
- poj2184 Cow Exhibition(01背包+变化)
- poj2184(Cow Exhibition) 变形0-1背包
- PWM (未完待续)
- 开篇序
- Algorithms—203.Remove Linked List Elements
- DataProvider不等于SQLHelper
- 左侧菜单栏如何延伸到页面最底部
- 【poj2184】【Cow Exhibition】
- 对fork()函数的理解
- 欢迎使用CSDN-markdown编辑器
- python3入门之字典
- hdu 5301 Buildings
- ios开发--UIGestureRecognizer
- iOS开发多线程篇—GCD介绍
- ehcache时如何持久化数据到磁盘,并且在应用服务器重启后不丢失数据
- NOT IN和NOT EXISTS小区别