CodeForces 545C Woodcutters （贪心）

http://codeforces.com/problemset/problem/545/C

Woodcutters

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 test(s)

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

Note

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].

分别判断当前这棵树往左倒和往右倒的情况，由于数据较大，所以每当砍倒一棵树的时候将该树倒下的那个点存到一个数组里，判断下一个（i+1）点的时候再判断（i+1）点前后的树是否在（i+1）点倒的范围内，和（i+1）点前后的树倒的点是否在该点倒的范围内

注意用long long

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <limits>
#include <queue>
#include <stack>
#include <vector>
#include <map>

using namespace std;
typedef long long LL;

#define N 110000
#define INF 0x3f3f3f3f
#define PI acos (-1.0)
#define EPS 1e-8
#define met(a, b) memset (a, b, sizeof (a))

struct node
{
    LL x, h;
}p[N];

LL a[N];

bool cmp (node a, node b)
{
    return a.h < b.h;
}

int main ()
{
    int n;
    while (scanf ("%d", &n) != EOF)
    {
        for (int i=0; i<n; i++)
            scanf ("%I64d %I64d", &p[i].x, &p[i].h);

        int cnt = 0, j = 1;
        met (a, 0);

        if (n >= 2) cnt = 2;
        else if (n == 1)
        {
            printf ("1\n");
            continue;
        }

        for (int i=1; i<n-1; i++)
        {
            if (p[i].x-p[i].h > p[i-1].x && p[i].x-p[i].h > a[j-1])//往左倒的情况
                cnt++;
            else if (p[i].x+p[i].h < p[i+1].x)//往右倒的情况
            {
                cnt++;
                a[j++] = p[i].x+p[i].h;
            }
        }
        printf ("%d\n", cnt);
    }
    return 0;
}