Pascal(fpc 3.0.2) 解法, 执行用时: 32ms, 内存消耗: 1000K, 提交时间: 2019-08-25 10:23:51

var
 a:array[0..1000000]of longint;
 n,b,i,j,f,c,e,d,s1,s2,t1,t2:longint;
begin
 read(n);
 d:=maxlongint;
 for i:=1 to n do
  begin
   read(b,c);
   for j:=b to c-1 do
    a[j]:=1;
   if b<d then d:=b;
   if c>e then e:=c;
  end;
 for i:=d to e-1 do
  begin
   if a[i]=1 then begin
                   s2:=0;
                   s1:=s1+1;
                   if s1>t1 then t1:=s1;
                  end
             else begin
                   s1:=0;
                   s2:=s2+1;
                   if s2>t2 then t2:=s2;
                  end;
  end;
 write(t1,' ',t2);
end.

C++11(clang++ 3.9) 解法, 执行用时: 7ms, 内存消耗: 1124K, 提交时间: 2019-12-01 18:23:33

#include<iostream>
using namespace std;
int a[1000010];
int main(){
	int n,d=2e9,c,e,s1=0,s2=0,t1=0,t2=0;
	cin>>n;
	for(int i=1;i<=n;i++){
		int b,c;
		cin>>b>>c;
		for(int j=b;j<=c-1;j++)
		a[j]=1;
		if(b<d)d=b;
		if(c>e)e=c;
	}
	for(int i=d;i<e;i++)
	if(a[i]==1){
		s2=0;
		s1++;
		if(s1>t1)t1=s1;
	}
	else{
		s1=0;
		s2++;
		if(s2>t2)t2=s2;
	}
	cout<<t1<<" "<<t2<<"\n";
	return 0; 
} 

Python3 解法, 执行用时: 63ms, 内存消耗: 6812K, 提交时间: 2021-05-21 12:18:38

n = int(input())
ls = []
for i in range(n):
    ls.append(list(map(int, input().split())))
ls.sort()
begin, end = ls[0][0], ls[0][1]
t1, t2 = 0, 0
for i in range(1, n):
    if ls[i][0] <= end:
        end = max(end, ls[i][1])
    else:
        t1 = max(t1, end - begin)
        t2 = max(t2, ls[i][0] - end)
        begin, end = ls[i][0], ls[i][1]
t1 = max(t1, end - begin)
print(t1, t2)