POJ2184-Cow Exhibition
来源:互联网 发布:centos 文件夹扩容 编辑:程序博客网 时间:2024/06/05 05:00
Cow Exhibition
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13477 Accepted: 5440
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
题意:有N头奶牛想参加CJ,每头奶牛的智商分别为S[i],情商为F[i]。欲挑出一群奶牛使得S之和与F之和都不为负数,且SF之和最大,求此最大值
解题思路:dp,不过因为有负的,所以起始点不为0
#include <iostream> #include <cstdio> #include <cstring> #include <string> #include <algorithm> #include <cmath> #include <map> #include <cmath> #include <set> #include <stack> #include <queue> #include <vector> #include <bitset> #include <functional> using namespace std;#define LL long long const int INF = 0x3f3f3f3f;int dp[200010],v[110],w[110],n;int main(){while (~scanf("%d", &n)){for (int i = 0; i<n; i++) scanf("%d%d", &v[i], &w[i]);memset(dp, -INF, sizeof dp);dp[100000] = 0;for (int i = 0; i<n; i++){if (v[i]>0){for (int j = 200000; j >= v[i]; j--)if (dp[j - v[i]]>-INF) dp[j] = max(dp[j], dp[j - v[i]] + w[i]);}else{for (int j = 0; j <= 200000 + v[i]; j++)if (dp[j - v[i]]>-INF) dp[j] = max(dp[j], dp[j - v[i]] + w[i]);}}int ans = 0;for (int i = 100000; i <= 200000; i++)if (dp[i] >= 0 && dp[i] + i - 100000>ans)ans = dp[i] + i - 100000;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背包
- Java 8 forEach 例子
- Python学习笔记之:文件基本操作
- TOGGLE_BOTTON控件
- Shell test命令
- 贪心法之TSP问题
- POJ2184-Cow Exhibition
- linux vi操作
- Kafka学习总结(六)——应用开发
- Python 地图坐标的转换
- js---如何通过js/jQuery代码出发节点的click事件
- 5.19滴滴大数据研发实习
- lua 数字格式化输出
- 智能IoT系统框架理论
- github中创建自己的cocoapod私有库_异常问题解决