CodeCoder vs TopForces Gym - 101142C

https://vjudge.net/problem/Gym-101142C

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
//#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 8e19
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------
const int maxn=1e6+9;
const int mod=1e9+7;

struct node
{
    int id,a,b;
}p[maxn];

bool cmp(node x,node y)
{
    return x.a<y.a;
}

ll ans[maxn];
int up[maxn];
ll tree[maxn<<2];

void update(int rt,int l,int r,int pos,int val)
{
    if(l==r)
    {
        tree[rt]=val;
        return ;
    }
    int mid=(l+r)>>1;
    if(pos<=mid) update(lson,l,mid,pos,val);
    else update(rson,mid+1,r,pos,val);
    tree[rt]=max(tree[lson],tree[rson]);
}

ll query(int rt,int l,int r,int L,int R)
{
    if(l>=L&&r<=R) return tree[rt];
    int mid=(l+r)>>1;
    ll ans=0;
    if(L<=mid) ans=max(ans,query(lson,l,mid,L,R));
    if(R>mid) ans=max(ans,query(rson,mid+1,r,L,R));
    return ans;
}

int main()
{
    //FAST_IO;

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

    freopen("codecoder.in","r",stdin);
    freopen("codecoder.out","w",stdout);

    int n;
    while(~scanf("%d",&n))
    {
        mem(tree,0);
        mem(up,0);
        for(int i=1;i<=n;i++)
        {
            scanf("%d%d",&p[i].a,&p[i].b);
            p[i].id=i;
        }
        sort(p+1,p+1+n,cmp);

        for(int i=1;i<=n;i++)
        {
            up[i]=max(up[i-1],p[i].b);
        }

        int m=1e6;
        //update(1,1,m,p[n].b,n-1);
        for(int i=n;i>=1;i--)
        {
            int b=p[i].b;
            int id=p[i].id;
            ans[id]=max((ll)i-1,query(1,1,m,1,up[i]));
            update(1,1,m,b,ans[id]);
        }

        for(int i=1;i<=n;i++)
        {
            printf("%I64d\n",ans[i]);
        }
    }


    return 0;
}