http://poj.org/problem?id=1922
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 16391 | Accepted: 6619 |
Description
We may assume that all the students except "Charley" ride from Wanliu to Yanyuan at a fixed speed. Charley is a student with a different riding habit – he always tries to follow another rider to avoid riding alone. When Charley gets to the gate of Wanliu, he will look for someone who is setting off to Yanyuan. If he finds someone, he will follow that rider, or if not, he will wait for someone to follow. On the way from Wanliu to Yanyuan, at any time if a faster student surpassed Charley, he will leave the rider he is following and speed up to follow the faster one.
We assume the time that Charley gets to the gate of Wanliu is zero. Given the set off time and speed of the other students, your task is to give the time when Charley arrives at Yanyuan.
Input
Vi [TAB] Ti
Vi is a positive integer <= 40, indicating the speed of the i-th rider (kph, kilometers per hour). Ti is the set off time of the i-th rider, which is an integer and counted in seconds. In any case it is assured that there always exists a nonnegative Ti.
Output
Sample Input
4 20 0 25 -155 27 190 30 240 2 21 0 22 34 0
Sample Output
780 771
Source
看到这题的描述中有"选择更快"的意思时,我就自觉往贪心上面想了,越想越觉得这题是贪心,因为每次Charley选择的都是当前最快的单车,而且Charley最后一定是和那个最快到达Yanyuan的单车同时到达。
无视负时间出发的单车(因为Charley还没到的时候单车就走了,他永远也追不上,所以我们只要看看比Charley晚出发的单车谁最快到达Yanyuan,让Charley跟着这辆车,最后的时间就是Charley到达的时间。
//veil()返回大于或者等于指定表达式的最小整数
#include<stdio.h>
#include<math.h>
int main()
{
}