Nội dung Bài tập
- Mã:
- MilkingCows
- Tên:
- Milking Cows
- Dạng thi:
- oi
- Thang điểm:
- 10 điểm
- Giới hạn thời gian:
- 1 giây
- Giới hạn bộ nhớ:
- 128 MB
- Nguồn bài tập:
- USACO TRAINING
- Được tạo bởi:
- duynm619
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 write a program that will examine a list of beginning and ending times for N (0 < N <= 105) 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.
INPUT FORMAT
Line 1 : The single integer N.
Line 2...N+1 : Two non-negative integers less than 1010, respectively the starting and ending time in seconds.
OUTPUT FORMAT
A single line with two integers that represent the longest continuous time of milking and the longest idle time.Example:
SAMPLE INPUT SAMPLE OUTPUT 3
300 1000
700 1200
1500 2100900 300
SAMPLE INPUT SAMPLE OUTPUT 3 300 1000 700 1200 1500 2100900 300
+ Exam is not avalable in the testcase :D
Theme :
Mời bạn soạn code
Ai có thể xem bài này :
Thông tin
Phần thảo luận
#include <iostream>using namespace std;struct ps { int tu, mau; &...