HJ浇花

版权声明：来自星空计算机团队(QQ群：134826825)——申屠志刚 https://blog.csdn.net/weixin_43272781/article/details/85399411

https://ac.nowcoder.com/acm/contest/322/M

题解：这些花加起来可以绕地球3圈？？？

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=200000+10;
const int M=1000000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,q,ans;
int a[M];
int l[N],r[N];
char str;
struct node{
    int l,r;
    bool operator <(const node &S){
        if(l==S.l)
            return r>S.r;
        return l<S.l;
    }
}e[N];

int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    scanf("%d",&n);
    memset(l,-1,sizeof(l));
    memset(r,-1,sizeof(r));
    for(int i=1;i<=n;i++){
        scanf("%d%d",&l[i],&r[i]);
    }
    //sort(e+1,e+n+1);
    sort(l+1,l+n+1);
    sort(r+1,r+n+1);
    int x=1,y=1;
    for(int i=0;i<=M;i++){
        while(l[x]==i)t++,x++;
        a[t]++;//cout << t << endl;
        while(r[y]==i)t--,y++;
    }
    for(int i=1;i<=n;i++){
        cout << a[i] <<" " ;
    }
    //cout << "Hello world!" << endl;
    return 0;
}