Starting a Scenic Railroad Service Gym - 101986I

https://cn.vjudge.net/problem/Gym-101986I 

 

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e6+9;

int d[maxn];

int up[maxn],down[maxn],st[maxn],ed[maxn];

int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    int Max=0;
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>st[i]>>ed[i];
        d[st[i]]++;
        d[ed[i]]--;

        up[st[i]]++;
        down[ed[i]]++;
        Max=max(Max,ed[i]);

    }

    int ans1=0;
    int ans2=0;
    for(int i=1;i<=Max;i++)
    {
        d[i]+=d[i-1];

        up[i]+=up[i-1];
        down[i]+=down[i-1];
    }

    for(int i=1;i<=n;i++)
    {
        ans1=max(ans1,up[ed[i]-1]-down[st[i]]);
        ans2=max(ans2,d[st[i]]);
    }
    cout<<ans1<<" "<<ans2<<endl;

    return 0;
}