Milking Cows
来源:互联网 发布:用c语言编写快速排序 编辑:程序博客网 时间:2024/04/28 18:10
Problem:
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
INPUT FORMAT
Line 1: The single integer Lines 2..N+1: Two non-negative integers less than 1000000, the starting and ending time in seconds after 0500SAMPLE INPUT (file milk2.in)
3300 1000700 12001500 2100
OUTPUT FORMAT
A single line with two integers that represent the longest continuous time of milking and the longest idle time.
SAMPLE OUTPUT (file milk2.out)
900 300
My Answer:
- Milking Cows
- Milking Cows
- Milking Cows
- Milking Cows
- Milking Cows
- milking cows
- milking cows
- Milking Cows
- Milking Cows
- Milking Cows
- Milking Cows
- Milking cows
- Milking Cows
- Milking Cows
- Milking Cows
- Milking Cows
- Chap1 Milking Cows
- Milking Cows【转帖】
- POJ 1006 Bioryhthms
- 终于调通了,高兴啊
- unsigned int 应用于 for 循环的注意事项
- 简单图形编程的学习(1)---文字 (Qt实现)
- 六则实用的Outlook应用技巧
- Milking Cows
- 今天早上的时候,有一位老太太在我面前跌到了
- 局域网即时通讯的可管理性
- 搜索引擎中倒排表的合理压缩分析
- OpenGL写的直线裁剪法
- 细心啊、、、终于做出了第一个RTT效果
- java编程心得(五)——JTextArea中用指定的新文本替换原有的某段文本并实现动态刷新
- 即时通讯系统的应用
- 便利的视频会议