学步园

Milking Cows

题意：给定一堆线段，求最长的不覆盖区间，和最长的覆盖区间

就是维护当前的一块线段，如果不是断开的，就把当前的线段包括进去，否则从当前线段开始

code

/*
ID : Your ID
LANG : C++
PROB : milk2
*/
#include <set>
#include <map>
#include <ctime>
#include <queue>
#include <cmath>
#include <stack>
#include <limits>
#include <vector>
#include <bitset>
#include <string>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <string.h>
#include <iostream>
#include <algorithm>
#define Si set<int>
#define LL long long
#define pb push_back
#define PS printf(" ")
#define Vi vector<int>
#define LN printf("\n")
#define lson l,m,rt << 1
#define rson m+1,r,rt<<1|1
#define SD(a) scanf("%d",&a)
#define PD(a) printf("%d",a)
#define SET(a,b) memset(a,b,sizeof(a))
#define FF(i,a) for(int i(0);i<(a);i++)
#define FD(i,a) for(int i(a);i>=(1);i--)
#define FOR(i,a,b) for(int i(a);i<=(b);i++)
#define FOD(i,a,b) for(int i(a);i>=(b);i--)
#define readf freopen("input.txt","r",stdin)
#define writef freopen("output.txt","w",stdout)
const int maxn = 1005;
const int INF = 0xfffffff;
const int dx[]={0,1,0,-1};
const int dy[]={1,0,-1,0};
const double pi = acos(-1.0);
using namespace std;
struct seg{
    int st,ed;
}a[5001];
bool cmp(const seg x,const seg y){
    return x.st<y.st;
}
int N,ans1,ans2;
int main()
{
    freopen("milk2.in","r",stdin);
    freopen("milk2.out","w",stdout);
    SD(N);
    FOR(i,1,N){
        SD(a[i].st);
        SD(a[i].ed);
    }
    sort(a+1,a+N+1,cmp);
    int left=a[1].st,right=a[1].ed;
    ans1=right-left;
    FOR(i,2,N){
        if(a[i].st>right){
            ans1=max(ans1,right-left);
            ans2=max(ans2,a[i].st-right);
            left=a[i].st;
            right=a[i].ed;
        }else   right=max(a[i].ed,right);
    }
    printf("%d %d\n",ans1,ans2);
    return 0;
}