Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|

Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |

Language: Exploration
Description Bessie is traveling on a road teeming with interesting landmarks. The road is labeled just like a number line, and Bessie starts at the "origin" ( x ≤ 100,000). Bessie wants to visit as many landmarks as possible before sundown, which occurs in _{i}T (1 ≤ T ≤ 1,000,000,000) minutes. She travels 1 distance unit in 1 minute.Bessie will visit the landmarks in a particular order. Since the landmarks closer to the origin are more important to Farmer John, she always heads for the unvisited landmark closest to the origin. No two landmarks will be the same distance away from the origin. Help Bessie determine the maximum number of landmarks she can visit before the day ends. Input * Line 1: Two space-separated integers: Output * Line 1: The maximum number of landmarks Bessie can visit. Sample Input 25 5 10 -3 8 -7 1 Sample Output 4 Source |

[Submit] [Go Back] [Status] [Discuss]

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di

Any problem, Please Contact Administrator