BZOJ4919 大根堆（动态规划+treap+启发式合并）

　　一个显然的dp是设f[i][j]为i子树内权值<=j时的答案，则f[i][j]=Σf[son][j]，f[i][a[i]]++，f[i][a[i]+1~n]对其取max。这样是可以线段树合并的，但实在太弱了不太会。

　　另一种做法是考虑扩展经典的单调队列优化LIS的做法，维护子树内答案为k时最小的最大值，用平衡树维护，在父亲处启发式合并，然后将父亲处权值插入即可。

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
#define ll long long
#define N 200010
#define lson tree[k].ch[0]
#define rson tree[k].ch[1]
char getc(){char c=getchar();while ((c<'A'||c>'Z')&&(c<'a'||c>'z')&&(c<''||c>'')) c=getchar();return c;}
int gcd(int n,int m){return m==?n:gcd(m,n%m);}
int read()
{
    int x=,f=;char c=getchar();
    while (c<''||c>'') {if (c=='-') f=-;c=getchar();}
    while (c>=''&&c<='') x=(x<<)+(x<<)+(c^),c=getchar();
    return x*f;
}
int n,a[N],b[N],fa[N],p[N],root[N],t,cnt;
struct data{int to,nxt;
}edge[N<<];
struct data2{int x,p,ch[],s;
}tree[N<<];
void addedge(int x,int y){t++;edge[t].to=y,edge[t].nxt=p[x],p[x]=t;}
void up(int k){tree[k].s=tree[lson].s+tree[rson].s+;}
void move(int &k,int p)
{
    int t=tree[k].ch[p];
    tree[k].ch[p]=tree[t].ch[!p],tree[t].ch[!p]=k,up(k),up(t),k=t;
}
void ins(int &k,int x)
{
    if (k==) {k=++cnt;tree[k].x=x,tree[k].p=rand(),tree[k].s=;return;}
    tree[k].s++;
    if (tree[k].x<x) {ins(rson,x);if (tree[rson].p>tree[k].p) move(k,);}
    else {ins(lson,x);if (tree[lson].p>tree[k].p) move(k,);}
}
void del(int &k,int x)
{
    if (tree[k].x==x)
    {
        if (lson==||rson==) {k=lson|rson;return;}
        if (tree[lson].p>tree[rson].p) move(k,),del(rson,x);
        else move(k,),del(lson,x);
    }
    else if (tree[k].x<x) del(rson,x);
    else del(lson,x);
    up(k);
}
int qrank(int k,int x)
{
    if (!k) return ;
    if (tree[k].x>=x) return qrank(lson,x);
    else return qrank(rson,x)+tree[lson].s+;
}
int find(int k,int x)
{
    if (tree[lson].s+==x) return tree[k].x;
    if (tree[lson].s+>x) return find(lson,x);
    else return find(rson,x-tree[lson].s-);
}
void dfsins(int k,int &x)
{
    if (!k) return;
    ins(x,tree[k].x);
    dfsins(lson,x),dfsins(rson,x);
}
int merge(int x,int y)
{
    if (tree[x].s<tree[y].s) swap(x,y);
    dfsins(y,x);
    return x;
}
void dfs(int k)
{
    for (int i=p[k];i;i=edge[i].nxt)
    if (edge[i].to!=fa[k])
    {
        dfs(edge[i].to);
        root[k]=merge(root[k],root[edge[i].to]);
    }
    int x=qrank(root[k],a[k]);
    if (x<tree[root[k]].s) del(root[k],find(root[k],x+));
    ins(root[k],a[k]);
}
int main()
{
#ifndef ONLINE_JUDGE
    freopen("bzoj4919.in","r",stdin);
    freopen("bzoj4919.out","w",stdout);
    const char LL[]="%I64d\n";
#else
    const char LL[]="%lld\n";
#endif
    n=read();srand();
    for (int i=;i<=n;i++)
    {
        b[i]=a[i]=read(),fa[i]=read();
        addedge(fa[i],i);
    }
    sort(b+,b+n+);
    int u=unique(b+,b+n+)-b-;
    for (int i=;i<=n;i++) a[i]=lower_bound(b+,b+u+,a[i])-b;
    dfs();
    cout<<tree[root[]].s;
    return ;
}