【差分】BZOJ 1635 [Usaco2007 Jan]Tallest Cow 最高的牛

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

const int INF=0x3f3f3f3f;

int n,i,h,r;
int Sum[10005];

map<pair<int,int>,bool>vis;

struct node{
    int l,r;
    bool operator <(const node &a) const{
        if(l==a.l) return r<a.r;
        return l<a.l;
    }
}ask[10005];

int main(){
    scanf("%d%d%d%d",&n,&i,&h,&r);
    for(int i=1;i<=r;i++){
        scanf("%d%d",&ask[i].l,&ask[i].r);
        if(ask[i].l>ask[i].r) swap(ask[i].l,ask[i].r);
        if(!vis[make_pair(ask[i].l,ask[i].r)]) vis[make_pair(ask[i].l,ask[i].r)]=1;
        else ask[i].l=INF,ask[i].r=INF;
    }
    sort(ask+1,ask+1+r);
    for(int i=1;i<=r;i++){
        if(ask[i].l!=INF) Sum[ask[i].l+1]--,Sum[ask[i].r]++;
        //printf("ask[%d].l:%d ask[%d].r:%d\n",i,ask[i].l,i,ask[i].r);
    }
    Sum[0]=h;
    for(int i=1;i<=n;i++){
        Sum[i]+=Sum[i-1];
        printf("%d\n",Sum[i]);
    }
    return 0;
}