51nod 1091 线段的重叠

左端点排序，扫一遍，维护右端点的最大值；因为左端点有序，故只需要当前左端点小于最大值即可保证相交。答案即每个相交的长度最大值。

#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<vector>
#include<cstring>
#include<stack>
#include <cmath>

#define mem(ss) memset(ss,0,sizeof(ss))
#define rep(d, s, t) for(int d=s;d<=t;d++)
#define rev(d, s, t) for(int d=s;d>=t;d--)
#define _max(a, b) ((a) > (b) ? (a) : (b))
#define _min(a, b) ((a) < (b) ? (a) : (b))
#define inf 0x3f3f3f3f
#define eps 1e-6
typedef std::pair<int, int> pii;
typedef std::pair<long long, long long> pll;
typedef long long ll;
typedef long double ld;
const double pi = acos(-1);
const int mod = 1e9 + 7;
const int N = 5e4 + 10;

ll gcd(ll p, ll q) { return q == 0 ? p : gcd(q, p % q); }

using namespace std;
pii a[N << 1];
int n;

int main() {
    cin >> n;
    rep(i, 0, n - 1)cin >> a[i].first >> a[i].second;
    sort(a, a + n);
    int ans = 0, maxr = a[0].second;
    rep(i, 1, n - 1) {
        if (a[i].first < maxr)
            ans = max(ans, min(a[i].second, maxr) - a[i].first);
        maxr = max(maxr, a[i].second);
    }
    cout << ans;
    return 0;
}