POJ 3045(递推找规律)

原创 2016年10月25日 08:28:17

Time Limit: 1000MS   Memory Limit: 65536KB   64bit IO Format: %lld & %llu

 Status

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头牛叠罗汉,每头牛有个体重Wi,力气Si.一头牛要承担的风险为所有在它上面的牛的体重之和-它的力气.

求一个方案使得风险最大的牛的风险值最小.


分析:对于相邻的两头牛,它们交换位置不影响其他的任何牛,只改变这两头牛的风险值.


记sum为这两头牛上面的牛的体重总和.i在j上面

Riski=sum-si

Riskj=sum+wi-sj

交换位置

Riski'=sum+wj-si

Riskj'=sum-sj

方案1优于方案2,则max{Riski,Riskj}<max{Riski',Riskj'}

而Riskj>Riskj'

所以Riski'>max{Riski,Riskj},且Riski'>Riskj'.

解之得

wj-si>sj

wj-si>wi-sj

wj-si>si

我们只需要中间的一条.记ti=si+wi

则方案1优于方案2等价于ti<tj,即ti小的在上会更优.

算法就简单了,排序,统计一遍就好了.


#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
const int N = 50010;
typedef long long LL;
struct node
{
    LL w, s, sum;
}p[N];
int cmp(node a,node b)
{
    return a.sum<b.sum;
}


int main()
{
    int n;
    while(scanf("%d", &n)!=EOF)
    {
        for(int i=0;i<n;i++)
        {
            scanf("%I64d %I64d", &p[i].w, &p[i].s);
            p[i].sum=p[i].w+p[i].s;
        }
        sort(p,p+n,cmp);
        LL ans=-p[0].s, cnt=0;
        for(int i=0;i<n;i++)
        {
            ans=max(ans,cnt-p[i].s);
            cnt+=p[i].w;
        }
        printf("%lld\n",ans);
    }
    return 0;
}

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

【NOIP 模拟题】求和 (打表找规律+递推)

一地落花散、散尽纵横的纷繁

【校内互侧】ZYF loves qaq (找规律+递推)

梦中你腾云驾雾,哪及战场一世披靡、万世名?

概率,递推,找规律,高精度(FXTZ II,hdu 4043)

总结一下吧。。 像这种题,输入很简单,就几个数,然而正常算运算量很大,或时间复杂度很高,或分类讨论很麻烦的题,就试试找规律吧。只能说很可能是找规律,但也有例外吧。 这题的话,手算或计算机算多几个小...

【数学题-递推找规律】BNU 4225 杨辉三角形

【题目链接】click here~~ 【题目大意】 LZM同学比较牛,Lsy最近也越来越生猛,他们思路快,代码速度神勇。近期惊闻此二人均要参加校赛,队里决定出些题目卡他们,因为他们的罢工给题目组留...

hdu Eddy's research II(递推,找规律,打表)

Eddy's research II Problem Description As is known, Ackermann function plays an important ...

hdu 2050折线分割平面(递推找规律)

Problem Description 我们看到过很多直线分割平面的题目,今天的这个题目稍微有些变化,我们要求的是n条折线分割平面的最大数目。比如,一条折线可以将平面分成两部分,两条折线最多可以...

UVAlive-6577 Binary Tree(递推+找规律)

传送门:UVA-6577 题意:有一个向下无限延伸的二叉树。有一串只含LRU的指令S,从根结点开始执行。LRU分别表示往左儿子走,往右儿子走,往父节点(如果当前节点为根节点,则跳过这一步)。然后输入...

CSU 1972: 大梵天的恩赐 <递推,找规律>

1972: 大梵天的恩赐 Submit Page     Summary    Time Limit: 4 Sec     Memory Limit: 128 Mb     Submi...

BZOJ(本校) 3048 染色 - dp&递推找规律

【问题描述】 最近大大很happy,她制作了一些小旗,小旗都排成一列。现在她有四种颜色,分别为R,B,W,Y。突发奇想的大大决定出个问题考考你。她想知道,n面小旗染色有多少种不同的方案数。这...

hdu 递推 2050 1290 2563 2064 2077 规律哥

(没有质量,就出数量) 转载出处:http://blog.sina.com.cn/s/blog_7fec19cd01010h60.html   hdu2050 折线分平面: 1.当有n-1条直线...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:POJ 3045(递推找规律)
举报原因:
原因补充:

(最多只允许输入30个字)