原创代码
仅供参考
欢迎评论O(∩_∩)O~
/*
ID: 输你自己的
PROG: milk2
LANG: C++
*/
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
struct ss{int a,b;};
ss s[5005];
bool c (const ss &z,const ss &v)
{
if(z.a!=v.a) return z.a<v.a;
else return z.b<v.b;
}
int main()
{
freopen("milk2.in","r",stdin);
freopen("milk2.out","w",stdout);
int n;
cin>>n;
for(int i=1;i<=n;i++)
cin>>s[i].a>>s[i].b;
int minn=0;
sort(s+1,s+1+n,c);
int ans1=s[1].b-s[1].a,ans2=0;
int x=s[1].a,y=s[1].b;
for(int i=2;i<=n;i++){
if(s[i].a<=y){
x=min(x,s[i].a);
y=max(y,s[i].b);
minn=max(minn,y-x);
}
else {
ans1=max(ans1,minn);
minn=0;
ans2=max(ans2,s[i].a-y);
x=s[i].a,y=s[i].b;
}
}
cout<<ans1<<' '<<ans2<<endl;
return 0;
}