hdu 1445 Ride to School
来源:互联网 发布:mac dmg镜像下载 编辑:程序博客网 时间:2024/06/01 17:28
Ride to School
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 637 Accepted Submission(s): 303
Problem Description
Many graduate students of Peking University are living in Wanliu Campus, which is 4.5 kilometers from the main campus - Yanyuan. Students in Wanliu have to either take a bus or ride a bike to go to school. Due to the bad traffic in Beijing, many students choose to ride a bike.
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.
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
There are several test cases. The first line of each case is N (1 <= N <= 10000) representing the number of riders (excluding Charley). N = 0 ends the input. The following N lines are information of N different riders, in such format:
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.
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
Output one line for each case: the arrival time of Charley. Round up (ceiling) the value when dealing with a fraction.
Sample Input
420 025 -15527 19030 240221 022 340
Sample Output
780771不论过程怎么坐车,他一定是跟着一辆车到达终点。
所以找出到达终点的车的时间的最小值,
#include<iostream>#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int main(){ int n; int t1,t2; while(scanf("%d",&n)&&n){ int ans=99999999,sum=0; for(int i=1;i<=n;i++){ scanf("%d%d",&t1,&t2); if(t2>=0){ double t=4500/(t1*5.0/18); if(t-(int)t>0.0) t++; sum=t+t2; //printf("%lf %d\n",t,t2); if(sum<ans) ans=sum; } } printf("%d\n",ans); } return 0;}
0 0
- hdu 1445 Ride to School
- HDU 1445 - Ride to School
- hdu 1445 Ride to School
- HDU 1445 Ride to School 贪心
- 文章标题 HDU 1445 : Ride to School (贪心)
- Ride to School
- POJ1922-Ride to School
- Ride to School(水题)
- POJ1992 Ride to School
- POJ1922 Ride to School
- Ride to School
- POJ1922 Ride to School
- Ride to School
- S-Ride to School
- POJ 1922 Ride to School
- fjnu 1007 Ride to School
- POJ 1922 Ride to School
- FOJ 1190 Ride to School
- scp
- 最全的常用正则表达式大全——包括校验数字、字符、一些特殊的需求等等
- 直接插入排序
- spring学习笔记(一)
- Ubuntu下深度环境的搭建opencv2.4.9+caffe+py-faster-rcnn+tensorflow的搭建
- hdu 1445 Ride to School
- 使用的书籍
- 远程拷贝文件
- Android获取手机信息
- ffmpeg视频分割,视频合成
- java读取远程文件
- Perl中chomp和chop的区别介绍
- Messagebox的简单用法
- 发布文章时生成静态文件