USACO 1.2

第一题：

这个题是输入一堆区间，来找最长的占用长度和最长的不占用长度。

这个可以用cnt 来代表这个区间被占用了几次，从前面向后面扫一次。

#include <stdio.h>
#include <iostream>
#include <queue>
#include <algorithm>
#include <map>
#include <vector>
#include <cmath>
#include <string.h>
#include <stdlib.h>
#include <time.h>
#include <fstream>
using namespace std;

#define READ freopen("milk2.in","r",stdin)
#define WRITE freopen("milk2.out","w",stdout);
#define ll long long
//#define PII pair<int,int>
#define PDI pair<double,int>
#define PDD pair<double,double>
#define MPI map<int,int>::iterator 
#define fst first
#define sec second
#define MS(x,d) memset(x,d,sizeof(x))
#define INF 0x3f3f3f3f
#define ALL(x) x.begin(),x.end()
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define MAX 5500
#define ROOT 0,n-1,1
#define PB push_back
#define FOR(a,b,c) for(int a=b;a<c;a++)
struct PII
{
    int fst,sec;
    bool operator < (const PII &o) const
    {
        if(fst!=o.fst)
            return fst<o.fst;
        return sec>o.sec;
    }
};
PII inter[20000];
int main()
{
    READ;
    WRITE;
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        for(int i=0;i<n;i++)
        {
            scanf("%d%d",&inter[i].fst,&inter[i+n].fst);
            inter[i].sec=1;
            inter[i+n].sec=-1;
        }
        sort(inter,inter+2*n);
        int ans1=0,ans2=0;
        int cnt=1;
        int res=inter[0].fst;
        PII last;
        last.fst=inter[0].fst;
        last.sec=1;
        int tmp=0;
        for(int i=1;i<2*n;i++)
        {
            cnt+=inter[i].sec;
            tmp+=inter[i].fst-last.fst;
            if(last.sec==0)
                ans2=max(tmp,ans2),tmp=0;
            if(cnt==0&&last.sec>0)
                ans1=max(tmp,ans1),tmp=0;
            last.fst=inter[i].fst;
            last.sec=cnt;
        }
        cout<<ans1<<" "<<ans2<<endl;
    }   
    return 0;
}