10105_MilkingCows

2022-5-16 18:16| 发布者: Hocassian| 查看: 82| 评论: 0|原作者: 肇庆学院ACM合集

摘要:
C:\Users\Administrator\Downloads\2019-10-12-10-14-3-89504556125800-Problem List-采集的数据-后羿采集器.html

Pro.ID

10105

Title

Milking Cows

Title链接

http://10.20.2.8/oj/exercise/problem?problem_id=10105

AC

131

Submit

521

Ratio

25.14%

时间&空间限制

  • Time Limit: 600/300 MS (Java/Others)     Memory Limit: 65536/65536 K (Java/Others)
  • 描述

    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.

    输入

    Line 1:  The single integer N

    Lines 2..N+1:  Two non-negative integers less than 1000000, the starting and ending time in seconds after 0500

    输出

    Description

    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.

    Input

    Line 1:  The single integer N

    Lines 2..N+1:  Two non-negative integers less than 1000000, the starting and ending time in seconds after 0500

    Output

    A single line with two integers that represent the longest continuous time of milking and the longest idle time.

    Sample Input

    3
    300 1000
    700 1200
    1500 2100

    Sample Output

    900 300

    Source

    样例输入

    3
    300 1000
    700 1200
    1500 2100

    样例输出

    900 300

    作者


    路过

    雷人

    握手

    鲜花

    鸡蛋

    最新评论

    返回顶部