Problem 2866 --1.2.1 Milking Cows

2866: 1.2.1 Milking Cows

"
Time Limit $1$ 秒/Second(s) Memory Limit $512$ 兆字节/Megabyte(s)
提交总数 $37$ 正确数量 $13$
裁判形式 标准裁判/Standard Judge 我的状态 尚未尝试
难度 分类标签 usaco 排序

Three farmers rise at 5 am each morning and head for the barn to milk three cows. The first farmer begins milking his cow at time 300 (measured in seconds after 5 am) and ends at time 1000. The second farmer begins at time 700 and ends at time 1200. The third farmer begins at time 1500 and ends at time 2100. The longest continuous time during which at least one farmer was milking a cow was 900 seconds (from 300 to 1200). The longest time no milking was done, between the beginning and the ending of all milking, was 300 seconds (1500 minus 1200).

Your job is to write a program that will examine a list of beginning and ending times for N (1 <= N <= 5000) farmers milking N cows and compute (in seconds):

  • The longest time interval at least one cow was milked.
  • The longest time interval (after milking starts) during which no cows were being milked.

PROGRAM NAME: milk2

Line 1: The single integer
Lines 2..N+1: Two non-negative integers less than 1000000, the starting and ending time in seconds after 0500
A single line with two integers that represent the longest continuous time of milking and the longest idle time. 
3
300 1000
700 1200
1500 2100

900 300

推荐代码 查看2866 所有题解 上传题解视频得图灵币

本题记录 用 户(点击查看用户) 运行号(点击购买题解) 时 间
算法最快[$0 $ms] z 460414 2019-08-29 20:08:54
内存最少[$1160 $KB] AOJ大管家 445524 2019-06-23 00:54:48
第一AC AOJ大管家 445410 2019-06-22 12:29:30
第一挑战 AOJ大管家 445409 2019-06-22 12:29:20

赛题来源/所属竞赛 usaco training usaco Training

竞赛编号 竞赛名称 竞赛时间 访问比赛
1405 安财贸20190918测试 2019-09-18 09:00:00 请登录