You are given n
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 0
in case the intersection is an empty set.
For example, the intersection of segments [1;5]
and [3;10] is [3;5] (length 2), the intersection of segments [1;5] and [5;7] is [5;5] (length 0) and the intersection of segments [1;5] and [6;6] is an empty set (length 0
).
Your task is to remove exactly one segment from the given sequence in such a way that the intersection of the remaining (n−1)
segments has the maximal possible length.
Input
The first line contains a single integer n
(2≤n≤3⋅105
) — the number of segments in the sequence.
Each of the next n
lines contains two integers li and ri (0≤li≤ri≤109) — the description of the i
-th segment.
Output
Print a single integer — the maximal possible length of the intersection of (n−1)
remaining segments after you remove exactly one segment from the sequence.
Examples
Input
Copy
4 1 3 2 6 0 4 3 3
Output
Copy
1
Input
Copy
5 2 6 1 3 0 4 1 20 0 4
Output
Copy
2
Input
Copy
3 4 5 1 2 9 20
Output
Copy
0
Input
Copy
2 3 10 1 5
Output
Copy
7
Note
In the first example you should remove the segment [3;3]
, the intersection will become [2;3] (length 1). Removing any other segment will result in the intersection [3;3] (length 0
).
In the second example you should remove the segment [1;3]
or segment [2;6], the intersection will become [2;4] (length 2) or [1;3] (length 2), respectively. Removing any other segment will result in the intersection [2;3] (length 1
).
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]
(length 7) if you remove the segment [1;5] or the intersection [1;5] (length 4) if you remove the segment [3;10].
题意：给你n条线段的起点 终点 问去点一条线段 他们共同包含线段的长度最大是多少
#include<cstdio>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<map>
#include<set>
#define N 0x3f3f3f3f
using namespace std;
multiset<int>a,b;
int c[300010],d[300010];
int main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>c[i]>>d[i];
a.insert(c[i]);//起点
b.insert(d[i]);//终点
}
int ans=0;
for(int i=1;i<=n;i++)
{
a.erase(a.find(c[i]));//去除当前起点 因为有重复的情况 所以用multiset
b.erase(b.find(d[i]));//去除当前终点
ans=max(ans,*b.begin()-*a.rbegin());//begin 为最大值 rbegin为最小值
a.insert(c[i]);
b.insert(d[i]);
}
cout<<ans<<endl;
}