shunfurh
编程介的小学生
2018-11-11 05:19
采纳率: 92.7%
浏览 398
已采纳

一个图的遍历的问题, 使用C语言来做

Problem Description
Wangye is interested in traveling. One day, he want to make a visit to some
different places in a line. There are N(1 <= N <= 2000) places located at points x1, x2, ..., xN (-100,000 ≤ xi ≤ 100,000). Wangye starts at HDU (x = 0), and he travels 1 distance unit in 1 minute . He want to know how many places he could visit at most, if he has T (1 <= T <= 200000 ) minutes.

Input
The input contains several test cases .Each test case starts with two number N and T which indicate the number of places and the time respectively. Then N lines follows, each line has a number xi indicate the position of i-th place.

Output
For each test case, you should print the number of places,Wangye could visit at most, in one line.

Sample Input
5 16
-3
-7
1
10
8

Sample Output
4

  • 点赞
  • 写回答
  • 关注问题
  • 收藏
  • 邀请回答

1条回答 默认 最新

相关推荐