Tourist

题意翻译

#### 给出一个数轴和n(n<=10^5)个事件，每个事件都(xi,ti) 表示第i个事件在位置xi处事件ti时刻发生，然后给出V表示该人的速度即使1s中最多能走了V单位长度。 #### 1问如果该人开始在0位置0时刻出发，最多能看到多少件。 #### 2该人在任何位置0时刻出发最多能够看到多少事件 ---by qihongzhou2

题目描述

Tourist walks along the $ X $ axis. He can choose either of two directions and any speed not exceeding $ V $ . He can also stand without moving anywhere. He knows from newspapers that at time $ t_{1} $ in the point with coordinate $ x_{1} $ an interesting event will occur, at time $ t_{2} $ in the point with coordinate $ x_{2} $ — another one, and so on up to ( $ x_{n},t_{n} $ ). Interesting events are short so we can assume they are immediate. Event $ i $ counts visited if at time $ t_{i} $ tourist was at point with coordinate $ x_{i} $ . Write program tourist that will find maximum number of events tourist if: - at the beginning (when time is equal to 0) tourist appears at point 0, - tourist can choose initial point for himself. Yes, you should answer on two similar but different questions.

输入输出格式

输入格式

The first line of input contains single integer number $ N $ ( $ 1<=N<=100000 $ ) — number of interesting events. The following $ N $ lines contain two integers $ x_{i} $ and $ t_{i} $ — coordinate and time of the $ i $ -th event. The last line of the input contains integer $ V $ — maximum speed of the tourist. All $ x_{i} $ will be within range $ -2·10^{8}<=x_{i}<=2·10^{8} $ , all $ t_{i} $ will be between $ 1 $ and $ 2·10^{6} $ inclusive. $ V $ will be positive and will not exceed 1000. The input may contain events that happen at the same time or in the same place but not in the same place at the same time.

输出格式

The only line of the output should contain two space-sepatated integers — maximum number of events tourist can visit in he starts moving from point 0 at time 0, and maximum number of events tourist can visit if he chooses the initial point for himself.

输入输出样例

输入样例 #1

3
-1 1
42 7
40 8
2

输出样例 #1

1 2