You are given nn segments on a number line; each endpoint of every segment has integer coordinates. Some segments can degenerate to points. Segments can intersect with each other, be nested in each other or even coincide.
The intersection of a sequence of segments is such a maximal set of points (not necesserily having integer coordinates) that each point lies within every segment from the sequence. If the resulting set isn’t empty, then it always forms some continuous segment. The length of the intersection is the length of the resulting segment or 00 in case the intersection is an empty set.
For example, the intersection of segments [1;5][1;5] and [3;10][3;10] is [3;5][3;5] (length 22), the intersection of segments [1;5][1;5] and [5;7][5;7] is [5;5][5;5](length 00) and the intersection of segments [1;5][1;5] and [6;6][6;6] is an empty set (length 00).
Your task is to remove exactly one segment from the given sequence in such a way that the intersection of the remaining (n−1)(n−1)segments has the maximal possible length.
Input
The first line contains a single integer nn (2≤n≤3⋅1052≤n≤3⋅105) — the number of segments in the sequence.
Each of the next nn lines contains two integers lili and riri (0≤li≤ri≤1090≤li≤ri≤109) — the description of the ii-th segment.
Output
Print a single integer — the maximal possible length of the intersection of (n−1)(n−1) remaining segments after you remove exactly one segment from the sequence.
Examples
input
4
1 3
2 6
0 4
3 3
output
1
input
5
2 6
1 3
0 4
1 20
0 4
output
2
input
3
4 5
1 2
9 20
output
0
input
2
3 10
1 5
output
7
Note
In the first example you should remove the segment [3;3][3;3], the intersection will become [2;3][2;3] (length 11). Removing any other segment will result in the intersection [3;3][3;3] (length 00).
In the second example you should remove the segment [1;3][1;3] or segment [2;6][2;6], the intersection will become [2;4][2;4] (length 22) or [1;3][1;3](length 22), respectively. Removing any other segment will result in the intersection [2;3][2;3] (length 11).
In the third example the intersection will become an empty set no matter the segment you remove.
In the fourth example you will get the intersection [3;10][3;10] (length 77) if you remove the segment [1;5][1;5] or the intersection [1;5][1;5] (length 44) if you remove the segment [3;10][3;10].
题意：删除一组线段后使其余线段的交集最大
思路：找到最大的左端点，最大的右端点，次大的左端点，次大的右端点（对结果影响最大）
1.最大的左端点和最大的右端点是同一条线段，选取次大的左端点和右端点；
2.选取删除最大左端点和右端点两种情况的最大值；
（结果肯定非负）
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
int l1,l2,r1,r2,x,y,l,r,n;
l1=l2=r1=r2=-1;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d%d",&l,&r);
if(l1==-1||l>l1)
{
l2=l1;
l1=l;
x=i;
}
else if(l2==-1||l>l2)
l2=l;
if(r1==-1||r<r1)
{
r2=r1;
r1=r;
y=i;
}
else if(r2==-1||r<r2)
r2=r;
}
if(x==y) printf("%d\n",max(0,r2-l2));
else printf("%d\n",max(0,max(r2-l1,r1-l2)));
}