Milking Cows

题目描述：

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):

输入输出格式：

SAMPLE INPUT (file milk2.in)

3
300 1000
700 1200
1500 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

题目大意：

三个农民每天清晨5点起床，然后去牛棚给3头牛挤奶。第一个农民在300时刻(从5点开始计时，秒为单位)给他的牛挤奶，一直到1000时刻。第二个农民在700时刻开始，在 1200时刻结束。第三个农民在1500时刻开始2100时刻结束。期间最长的至少有一个农民在挤奶的连续时间为900秒(从300时刻到1200时刻)，而最长的无人挤奶的连续时间(从挤奶开始一直到挤奶结束)为300时刻(从1200时刻到1500时刻)。 你的任务是编一个程序，读入一个有N个农民(1 <= N <= 5000)挤N头牛的工作时间列表，计算以下两点(均以秒为单位): 最长至少有一人在挤奶的时间段。 最长的无人挤奶的时间段。（从有人挤奶开始算起） 

解题思路：

一定要配合代码来看，我使用python来写的解题代码，有问题，在usaco提交会出现5000个数字那个会超时，改成c++版本就不会有问题，c++版本在网上有许多我就不贴了，然后大概看了一下算法复杂度大概在O（nlogn+n），我以为用python不会存在超时问题，但是最后还是超时了，然后我又看了一下运行时间，c++版与python的差距大约是10倍，所以要用python要注意时间问题，大概思路就是要先按时间表进行排序，然后进行合并，看代码，看代码

"""
ID: scwswx2
LANG: PYTHON3
TASK: milk2
"""
fin = open ('test.in', 'r')
fout = open ('test.out', 'w')
sumline=int(fin.readline().strip('\n'))
list=[]
for i in  range(sumline):
    begin,end=map(int,fin.readline().split())
    a={'begin':begin,'end':end}
    list.append(a)
list.sort(key=lambda k:(k.get('begin',0)))#先进行排序
ans=0
for i in range(sumline):#找到最大那段
    left=list[i].get('begin')
    right=list[i].get('end')
    for j in range(i,sumline):
        if list[j].get('begin')>right:
            break
        else:
            right=max(list[j].get('end'),right)
    ans=max(ans,(right-left))
#print(ans)
#找到最小那一段
cnt=0
r=list[0].get('end')
for i in range(sumline):
    if list[i].get('begin')>r:
        cnt=max(cnt,(list[i].get('begin')-r))
    r=max(r,list[i].get('end'))
#print(ans,cnt)
fout.write(str(ans)+' '+str(cnt)+'\n')
fout.close()