zoukankan      html  css  js  c++  java
  • C

    Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

    Description

    Little Susie listens to fairy tales before bed every day. Today's fairy tale was about wood cutters and the little girl immediately started imagining the choppers cutting wood. She imagined the situation that is described below.

    There are n trees located along the road at points with coordinates x1, x2, ..., xn. Each tree has its height hi. Woodcutters can cut down a tree and fell it to the left or to the right. After that it occupies one of the segments [xi - hi, xi] or [xi;xi + hi]. The tree that is not cut down occupies a single point with coordinate xi. Woodcutters can fell a tree if the segment to be occupied by the fallen tree doesn't contain any occupied point. The woodcutters want to process as many trees as possible, so Susie wonders, what is the maximum number of trees to fell.

    Input

    The first line contains integer n (1 ≤ n ≤ 105) — the number of trees.

    Next n lines contain pairs of integers xi, hi (1 ≤ xi, hi ≤ 109) — the coordinate and the height of the і-th tree.

    The pairs are given in the order of ascending xi. No two trees are located at the point with the same coordinate.

    Output

    Print a single number — the maximum number of trees that you can cut down by the given rules.

    Sample Input

    Input
    5
    1 2
    2 1
    5 10
    10 9
    19 1
    Output
    3
    Input
    5
    1 2
    2 1
    5 10
    10 9
    20 1
    Output
    4

    Hint

    In the first sample you can fell the trees like that:

    • fell the 1-st tree to the left — now it occupies segment [ - 1;1]
    • fell the 2-nd tree to the right — now it occupies segment [2;3]
    • leave the 3-rd tree — it occupies point 5
    • leave the 4-th tree — it occupies point 10
    • fell the 5-th tree to the right — now it occupies segment [19;20]

    In the second sample you can also fell 4-th tree to the right, after that it will occupy segment [10;19].

    题意:一条路上有树,树有高度h,我们可以将树向左或向右砍倒只要它倒下去不会压到其他树(不论这些树是站着还是倒下了)。求最多可以砍倒多少树。

    这一场cf真是水的一匹,我当时怎么没打!!!简直上分福利局。

    我们只要按照题目给定的操作走一遍就可以了。优先向左倒,就连数据都已经给你排好序了。

    附AC代码:

     1 #include<iostream>
     2 using namespace std;
     3 
     4 long long x[100010];
     5 long long h[100010];
     6 
     7 int main(){
     8     int n;
     9     cin>>n;
    10     for(int i=0;i<n;i++){
    11         cin>>x[i]>>h[i];
    12     }
    13     if(n>2){
    14         int ans=2;
    15     for(int i=1;i<n-1;i++){
    16         if(x[i]-h[i]>x[i-1]){
    17             ans++;
    18         }
    19         else if(x[i]+h[i]<x[i+1]){
    20             ans++;
    21             x[i]+=h[i];
    22         }
    23     }
    24     cout<<ans<<endl;
    25     }
    26     else
    27     cout<<n<<endl;
    28     return 0;
    29 }
  • 相关阅读:
    python学习笔记-4-列表和元组
    迭代器 生成器, 可迭代对象以及应用场景
    mysql的创创建用户阶段 开启客户端登录和授权阶段
    初识mysql数据库
    拆目录
    日志编码
    数据库mysql的安装.启动和基础配置------windows版本
    协程
    线程锁 死锁现象 递归锁 信号量 条件定时器 队列 线程池
    网络线程
  • 原文地址:https://www.cnblogs.com/Kiven5197/p/5709828.html
Copyright © 2011-2022 走看看