USACO Section 1.2 Milking Cows

　　我感觉像杭电那个今天暑假不AC，数据太长，就不贴出来了

/*
	ID:linyvxi1
	TASK:milk2
	LANG:C++
*/
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
using namespace std;
#define N	5005
typedef struct {
	int s,e;
}Fa;
bool cmp(Fa a,Fa b)
{
	return	a.s<b.s;
}	
int main()
{
	FILE*	fin=fopen("milk2.in","r");
	FILE*	fout=fopen("milk2.out","w");

	int num;
	Fa fa[N];
	fscanf(fin,"%d",&num);
	int i;
	for(i=0;i<num;i++)
		fscanf(fin,"%d%d",&fa[i].s,&fa[i].e);
	sort(fa,fa+num,cmp);
	int max1=0,max2=0;
	Fa	cur=fa[0];
	for(i=1;i<num;i++){
		if(fa[i].s>cur.e){
			if(max2<fa[i].s-cur.e)
				max2=fa[i].s-cur.e;
			if(max1<cur.e-cur.s)
				max1=cur.e-cur.s;
			cur=fa[i];
		}
		else{
			if(fa[i].e>cur.e)
				cur.e=fa[i].e;
		}
	}
	if(max1<cur.e-cur.s)
		max1=cur.e-cur.s;
	fprintf(fout,"%d %d\n",max1,max2);
}