Codeforces--785B--Anton and Classes

题目描述：
Anton likes to play chess. Also he likes to do programming. No wonder that he decided to attend chess classes and programming classes.
Anton has n variants when he will attend chess classes, i-th variant is given by a period of time (l1, i, r1, i). Also he has m variants when he will attend programming classes, i-th variant is given by a period of time (l2, i, r2, i).
Anton needs to choose exactly one of n possible periods of time when he will attend chess classes and exactly one of m possible periods of time when he will attend programming classes. He wants to have a rest between classes, so from all the possible pairs of the periods he wants to choose the one where the distance between the periods is maximal.
The distance between periods (l1, r1) and (l2, r2) is the minimal possible distance between a point in the first period and a point in the second period, that is the minimal possible |i - j|, where l1 ≤ i ≤ r1 and l2 ≤ j ≤ r2. In particular, when the periods intersect, the distance between them is 0.
Anton wants to know how much time his rest between the classes will last in the best case. Help Anton and find this number!
输入描述:
The first line of the input contains a single integer n (1 ≤ n ≤ 200 000) — the number of time periods when Anton can attend chess classes.
Each of the following n lines of the input contains two integers l1, i and r1, i (1 ≤ l1, i ≤ r1, i ≤ 109) — the i-th variant of a period of time when Anton can attend chess classes.
The following line of the input contains a single integer m (1 ≤ m ≤ 200 000) — the number of time periods when Anton can attend programming classes.
Each of the following m lines of the input contains two integers l2, i and r2, i (1 ≤ l2, i ≤ r2, i ≤ 109) — the i-th variant of a period of time when Anton can attend programming classes.
输出描述:
Output one integer — the maximal possible distance between time periods.
输入：
3
1 5
2 6
2 3
2
2 4
6 8
3
1 5
2 6
3 7
2
2 4
1 4
输出：
3
0
题意：
给你n个时间段，表示anton学象棋的，m个时间段，表示anton学编程的，让你选择两个时间段使得他们之间的间隔最大，如果间隔小于零则去零
题解：
简单贪心。

1. 找到象棋最早结束和编程最晚开始。
2. 找到象棋最晚开始和编程最早结束。

胡乱搞一下就好了

代码：

#include<cstring>
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;

const int inf = 1e9;

int main(){
    int n,m;
    while(scanf("%d",&n)!=EOF){
        int l,r;
        int maxx1 = -inf,maxx2 = -inf;
        int minn1 = inf,minn2 = inf;
        for(int i = 1; i <= n; i ++){
            scanf("%d%d",&l,&r);
            minn1 = min(r,minn1);
            maxx1 = max(maxx1,l);
        }
        scanf("%d",&m);
        for(int j = 1; j <= m; j ++){
            scanf("%d%d",&l,&r);
            maxx2 = max(maxx2,l);
            minn2 = min(minn2,r);
        }
        int ans = max((maxx1 - minn2),(maxx2 - minn1));
        if(ans < 0) ans = 0;
        printf("%d\n",ans);
    }
    return 0;
}