小石的妹子

https://ac.nowcoder.com/acm/contest/949/F 

总结：虽然以前做过排序一维，另一维线段树维护，但做的少，难出思路；

 

#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-8
#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)

//----------------------------------------------------------
inline ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}
//----------------------------------------------------------


const int maxn=1e5+9;
const int mod=1e9+7;

struct node
{
    int a,b;
    int id;

}p[maxn];
int mp[maxn];
int ans[maxn];
int tree[maxn*4];
bool cmp(node x,node y)
{
    if(x.a==y.a) return x.b>y.b;
    return x.a>y.a;
}

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(rt<<1,l,mid,pos,val);
    else update(rt<<1|1,mid+1,r,pos,val);
    tree[rt]=max(tree[rt<<1],tree[rt<<1|1]);
}

int query(int rt,int l,int r,int ql,int qr)
{
    if(ql<=l&&qr>=r) return tree[rt];
    int mid=(l+r)>>1;
    int ans=0;
    if(ql<=mid) ans=max(ans,query(rt<<1,l,mid,ql,qr));
    if(qr>mid) ans=max(ans,query(rt<<1|1,mid+1,r,ql,qr));
    return ans;
}

int main()
{
    //FAST_IO;

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

    int n;
    int cnt=0;
    cin>>n;
    for(int i=1;i<=n;i++) cin>>p[i].a>>p[i].b,p[i].id=i,mp[++cnt]=p[i].b;
    sort(mp+1,mp+1+cnt);
    cnt=unique(mp+1,mp+1+cnt)-(mp+1);
    for(int i=1;i<=n;i++)
    {
        p[i].b=lower_bound(mp+1,mp+1+cnt,p[i].b)-mp;
    }
    sort(p+1,p+n+1,cmp);
    for(int i=1;i<=n;i++)
    {
        ans[p[i].id]=query(1,1,cnt,p[i].b+1,cnt)+1;
        update(1,1,cnt,p[i].b,ans[p[i].id]);
    }
    for(int i=1;i<=n;i++) cout<<ans[i]<<endl;
    return 0;
}