POJ:3045-Cow Acrobats
Cow Acrobats
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 6253 Accepted: 2345
Description
Farmer John’s N (1 <= N <= 50,000) cows (numbered 1..N) are planning to run away and join the circus. Their hoofed feet prevent them from tightrope walking and swinging from the trapeze (and their last attempt at firing a cow out of a cannon met with a dismal failure). Thus, they have decided to practice performing acrobatic stunts.
The cows aren’t terribly creative and have only come up with one acrobatic stunt: standing on top of each other to form a vertical stack of some height. The cows are trying to figure out the order in which they should arrange themselves ithin this stack.
Each of the N cows has an associated weight (1 <= W_i <= 10,000) and strength (1 <= S_i <= 1,000,000,000). The risk of a cow collapsing is equal to the combined weight of all cows on top of her (not including her own weight, of course) minus her strength (so that a stronger cow has a lower risk). Your task is to determine an ordering of the cows that minimizes the greatest risk of collapse for any of the cows.
Input
Line 1: A single line with the integer N.
Lines 2..N+1: Line i+1 describes cow i with two space-separated integers, W_i and S_i.
Output
- Line 1: A single integer, giving the largest risk of all the cows in any optimal ordering that minimizes the risk.
Sample Input
3
10 3
2 5
3 3
Sample Output
2
Hint
OUTPUT DETAILS:
Put the cow with weight 10 on the bottom. She will carry the other two cows, so the risk of her collapsing is 2+3-3=2. The other cows have lower risk of collapsing.
解题心得:
- 有n头牛,每一只牛有重量和力量,现在n只牛叠罗汉,每只牛的风险等于他头上牛的重量总和减去这只牛的力量。问怎么排列,使最大风险牛的风险最小。有两种想法。
- 挑战上面说这是一个二分题,其实就是一个贪心啊,先假设每一只牛都放在最下面,算出风险,然后将风险最小的那个放在下面,这样风险大的就可以减去已经安放了风险小的牛的重量,这样得到的风险就会逐步减小,最后风险最大的就是最小的。
- 也可以这样想,假设有两只牛a和b,a的重量为w1,力量为p1,b的重量为w2,力量为p2,如果将a放在下面,a的风险就是p1-w2,如果将b放在下面,风险就是p2-w1。如果a的风险比b的风险更小就会得到一个关系式:p1-w2
#include <stdio.h>
#include <algorithm>
#include <cstring>
using namespace std;
const int maxn =5e4+100;
struct COW{
int va,w;
long long press;
}cow[maxn];
int n;
bool cmp(COW a,COW b) {
return a.press < b.press;
}
void init() {
scanf("%d",&n);
long long sum = 0;
for(int i=0;i<n;i++) {
scanf("%d%d",&cow[i].w,&cow[i].va);
sum += cow[i].w;
}
for(int i=0;i<n;i++) {
cow[i].press = sum - cow[i].w - cow[i].va;
}
sort(cow,cow+n,cmp);
}
long long get_oder() {
long long cut = 0;
long long ans = -10*(long long)0x7f7f7f7f;
for(int i=0;i<n;i++) {
cow[i].press = cow[i].press - cut;
ans = max(ans,cow[i].press);
cut += cow[i].w;
}
return ans;
}
int main() {
init();
long long ans = get_oder();
printf("%lld\n",ans);
return 0;
}
第二种想法的代码:
#include <stdio.h>
#include <algorithm>
#include <cstring>
using namespace std;
const int maxn =5e4+100;
struct COW{
int va,w;
}cow[maxn];
int n;
bool cmp(COW a,COW b) {
return a.va + a.w > b.va + b.w;
}
void init() {
scanf("%d",&n);
for(int i=0;i<n;i++) {
scanf("%d%d",&cow[i].w,&cow[i].va);
}
sort(cow,cow+n,cmp);
}
long long get_oder() {
long long sum = 0;
long long Max = -10*(long long)0x7f7f7f7f7f;
for(int i=n-1;i>=0;i--) {
long long temp = sum - cow[i].va;
sum += cow[i].w;
Max = max(Max,temp);
}
return Max;
}
int main() {
init();
long long ans = get_oder();
printf("%lld\n",ans);
return 0;
}
POJ:3045-Cow Acrobats的更多相关文章
- POJ 3045 Cow Acrobats (贪心)
POJ 3045 Cow Acrobats 这是个贪心的题目,和网上的很多题解略有不同,我的贪心是从最下层开始,每次找到能使该层的牛的风险最小的方案, 记录风险值,上移一层,继续贪心. 最后从遍历每一 ...
- poj 3045 Cow Acrobats(二分搜索?)
Description Farmer John's N (1 <= N <= 50,000) cows (numbered 1..N) are planning to run away a ...
- POJ 3045 Cow Acrobats
Description Farmer John's N (1 <= N <= 50,000) cows (numbered 1..N) are planning to run away a ...
- POJ 3045 Cow Acrobats (最大化最小值)
题目链接:click here~~ [题目大意] 给你n头牛叠罗汉.每头都有自己的重量w和力量s,承受的风险数rank就是该牛上面全部牛的总重量减去该牛自身的力量,题目要求设计一个方案使得全部牛里面风 ...
- POJ - 3045 Cow Acrobats (二分,或者贪心)
一开始是往二分上去想的,如果risk是x,题目要求则可以转化为一个不等式,Si + x >= sigma Wj ,j表示安排在i号牛上面的牛的编号. 如果考虑最下面的牛那么就可以写成 Si + ...
- POJ:3268-Silver Cow Party
Silver Cow Party Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 26184 Accepted: 11963 De ...
- POJ3045 Cow Acrobats —— 思维证明
题目链接:http://poj.org/problem?id=3045 Cow Acrobats Time Limit: 1000MS Memory Limit: 65536K Total Sub ...
- poj3045 Cow Acrobats (思维,贪心)
题目: poj3045 Cow Acrobats 解析: 贪心题,类似于国王游戏 考虑两个相邻的牛\(i\),\(j\) 设他们上面的牛的重量一共为\(sum\) 把\(i\)放在上面,危险值分别为\ ...
- 【POJ - 3045】Cow Acrobats (贪心)
Cow Acrobats Descriptions 农夫的N只牛(1<=n<=50,000)决定练习特技表演. 特技表演如下:站在对方的头顶上,形成一个垂直的高度. 每头牛都有重量(1 & ...
随机推荐
- cookie乱码处理 示例
package com.log; import java.io.IOException; import java.net.URLEncoder; import java.util.ArrayList; ...
- Programming for thread in Java
Programming for thread in Java Override Annotation package java.lang; import java.lang.annotation.El ...
- Touch事件传递的实验
通过自定义的Relayout LinearLayout TextView , 布局为: 分别打印事件方法: 1.当所有的都是super的时候,点击TextView的时候,事件的传递是: ...
- 我的ORM框架
任何系统的基础,都可以算是各种数据的增删改查(CRUD).最早操作数据是直接在代码里写SQL语句,后来出现了各种ORM框架.C#下的ORM框架有很多,如微软自己的Entity Framework.第三 ...
- check_mk手动安装
官方omd rpm包安装 yum -y install /tmp/check-mk-raw-1.2.6p2.demo-el6-34.x86_64.rpm omd create la omd confi ...
- 关于 IntelliJ IDEA 的Maven 版本修改
Project Structure->Project里Project sdk以及project language level Project Structure->Modules里Sour ...
- ubuntu查看nvidia显卡状态
nvidia-smi 连续查看显卡状态 sudo watch nvidia-smi
- java Date equals 的坑
今天在JDK6上做开发,遇到一个很诡异的问题. Domain中一个实体是Date,称为变量 a, 使用Calendar构造出来的Date,称为变量b, 虽然都是同一天,比如 2016-11-11 00 ...
- April 24 2017 Week 17 Monday
Much effort, much prosperity. 越努力,越幸运. I have ever seen this sentence in many people's signature of ...
- cesium 实现路径漫游功能
功能:路径漫游. 详细:绘制多个路径,删除路径,漫游路径选择,路径漫游. ①绘制路径 ②保存路径 ③路径切换 ④路径漫游 ⑤路径删除 ⑥删除完成