[openjudge] Ride to Office

电车痴汉

描述

Many staff of are living in a place called MZone, far from their office( 4.5 km ). Due to the bad traffic, many staff choose to ride a bike.

We may assume that all the people except "Weiwei" ride from home to office at a fixed speed. Weiwei is a people with a different riding habit – he always tries to follow another rider to avoid riding alone. When Weiwei gets to the gate of MZone, he will look for someone who is setting off to the Office. If he finds someone, he will follow that rider, or if not, he will wait for someone to follow. On the way from his home to office, at any time if a faster student surpassed Weiwei, he will leave the rider he is following and speed up to follow the faster one.

We assume the time that Weiwei gets to the gate of MZone is zero. Given the set off time and speed of the other people, your task is to give the time when Weiwei arrives at his office.

输入

There are several test cases. The first line of each case is N (1 <= N <= 10000) representing the number of riders (excluding Weiwei). 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.

输出

Output one line for each case: the arrival time of Weiwei. Round up (ceiling) the value when dealing with a fraction.

样例输入

样例输出

780
771

对于n个骑行者，你，电车痴汉，从时刻0开始出发，谁快就跟着谁。

恍惚间，你会发现你最后一个尾随的人到达的时间就是你最快的时间，因为用时最少那么他一定会追上你，你一定会最后跟着他走，他到达的时间也就是你达到的最少时间了
t<0不用考虑，人家早跑了你尾行谁去？

#include<cmath>
#include<cstdio>
#include<iostream>
#define N 10010
using namespace std;
const int inf=1<<30;
int v,t;
int n,ans;
int main(){while (scanf("%d",&n) && n){ans=inf;for (int i=1;i<=n;i++){scanf("%d%d",&v,&t);if (t<0) continue;int time=(int) ceil(4.5/v * 3600) +t;ans=min(ans,time);}printf("%d\n",ans);}return 0;
}

[openjudge] Ride to Office相关推荐

信息学奥赛一本通 1227：Ride to Office | OpenJudge NOI 4.6 2404:Ride to Office
[题目链接] ybt 1227:Ride to Office OpenJudge NOI 4.6 2404:Ride to Office 原题是英文题,虽说两题题意相同,但一本通网站没有对该问题进行直 ...
信息学奥赛一本通（1227：Ride to Office）
1227:Ride to Office 时间限制: 1000 ms 内存限制: 65536 KB 提交数: 5002 通过数: 2822 [题目描述] 起点与终点相隔4500米 ...
1227：Ride to Office
题目来源:http://ybt.ssoier.cn:8088/problem_show.php?pid=1227 1227:Ride to Office 时间限制: 1000 ms 内 ...
Ride to Office（信息学奥赛一本通-T1227）
[题目描述] 起点与终点相隔4500米.现Charley 需要从起点骑车到终点.但是,他有个习惯,沿途需要有人陪伴,即以相同的速度, 与另外一个人一起骑.而当他遇到以更快的速度骑车的人时,他会以相应的 ...
D29：Post Office（邮局，翻译）
原题:OpenJudge - 162:Post Office 翻译: 描述:有一条笔直的公路,公路旁边有村庄.公路表示为一个整数轴,每个村庄的位置用一个单一的整数坐标来标识.村庄处于不同位置.两个位置 ...
基础算法 —— 贪心算法
[概述] 贪心算法是从问题的初始状态出发,通过若干次的贪心选择而得到的最优值的一种求解策略,即贪心策略. 简单来说,贪心策略是一种在每次决策时采取当前意义下最优策略的算法,做出的选择至少在某种约束条件 ...
C++奥赛一本通贪心题解
C++奥赛一本通刷题记录(贪心) 2017.11.15 By gwj1139177410 书不见了,占坑待填. An Easy Problem poj2453 //贪心, 将最右边第一个01改成10并 ...
贪心题集（vjoj）
首先总结一下贪心,算法贪心算法(重点就是一个贪字)是指,在对问题求解时,总是做出在当前看来是最好的选择.也就是说,不从整体最优上加以考虑,他所做出的是在某种意义上的局部最优解,而每个局部最优解的总和就 ...
信息学奥赛一本通（基础算法与数据结构-题解汇总目录）
信息学奥赛一本通(C++版)在线评测系统基础(二)基础算法更新中...... 第一章高精度计算 1307[例1.3]高精度乘法 1308[例1.5]高精除 1309[例1.6]回文数(Noip ...

[openjudge] Ride to Office

电车痴汉

[openjudge] Ride to Office相关推荐

最新文章

热门文章