「2019牛客多校第一场A」Equivalent Prefixes【笛卡尔树+二分】

传送门：https://ac.nowcoder.com/acm/contest/881/A

题意

• 给定序列$a,b$，长度均为n，问最大的$pos$值，使得对任意的$1\le l\le r\le pos$，使得序列$a$的区间$[l,r]$内的最小值对应的下标等于序列$b$的区间$[l,r]$内最小值对应的下标

题解

• 由笛卡尔树的性质知，笛卡尔树上任意一个节点对应的值是以它为根节点的子树对应的连续区间的最值，显然，若每一个区间对应的最小值下标都相同，那么其前缀对应的两棵笛卡尔树一定相同，所以可以二分然后建笛卡尔树，看两棵树是否相同

代码

#include<bits/stdc++.h>

using namespace std;
const int maxn=5e5+10;

namespace IO{ 
    #define BUF_SIZE 100000 
    #define OUT_SIZE 100000 
    #define ll long long 
    //fread->read 

    bool IOerror=0; 
    inline char nc(){ 
        static char buf[BUF_SIZE],*p1=buf+BUF_SIZE,*pend=buf+BUF_SIZE; 
        if (p1==pend){ 
            p1=buf; pend=buf+fread(buf,1,BUF_SIZE,stdin); 
            if (pend==p1){IOerror=1;return -1;} 
            //{printf("IO error!\n");system("pause");for (;;);exit(0);} 
        } 
        return *p1++; 
    } 
    inline bool blank(char ch){return ch==' '||ch=='\n'||ch=='\r'||ch=='\t';} 
    inline bool read(int &x){ 
        bool sign=0; char ch=nc(); x=0; 
        for (;blank(ch);ch=nc()); 
        if (IOerror)return false; 
        if (ch=='-')sign=1,ch=nc(); 
        for (;ch>='0'&&ch<='9';ch=nc())x=x*10+ch-'0'; 
        if (sign)x=-x; 
        return true; 
    } 
    inline void read(ll &x){ 
        bool sign=0; char ch=nc(); x=0; 
        for (;blank(ch);ch=nc()); 
        if (IOerror)return; 
        if (ch=='-')sign=1,ch=nc(); 
        for (;ch>='0'&&ch<='9';ch=nc())x=x*10+ch-'0'; 
        if (sign)x=-x; 
    } 
    inline void read(double &x){ 
        bool sign=0; char ch=nc(); x=0; 
        for (;blank(ch);ch=nc()); 
        if (IOerror)return; 
        if (ch=='-')sign=1,ch=nc(); 
        for (;ch>='0'&&ch<='9';ch=nc())x=x*10+ch-'0'; 
        if (ch=='.'){ 
            double tmp=1; ch=nc(); 
            for (;ch>='0'&&ch<='9';ch=nc())tmp/=10.0,x+=tmp*(ch-'0'); 
        } 
        if (sign)x=-x; 
    } 
    inline void read(char *s){ 
        char ch=nc(); 
        for (;blank(ch);ch=nc()); 
        if (IOerror)return; 
        for (;!blank(ch)&&!IOerror;ch=nc())*s++=ch; 
        *s=0; 
    } 
    inline void read(char &c){ 
        for (c=nc();blank(c);c=nc()); 
        if (IOerror){c=-1;return;} 
    } 
    //fwrite->write 
    struct Ostream_fwrite{ 
        char *buf,*p1,*pend; 
        Ostream_fwrite(){buf=new char[BUF_SIZE];p1=buf;pend=buf+BUF_SIZE;} 
        void out(char ch){ 
            if (p1==pend){ 
                fwrite(buf,1,BUF_SIZE,stdout);p1=buf; 
            } 
            *p1++=ch; 
        } 
        void print(int x){ 
            static char s[15],*s1;s1=s; 
            if (!x)*s1++='0';if (x<0)out('-'),x=-x; 
            while(x)*s1++=x%10+'0',x/=10; 
            while(s1--!=s)out(*s1); 
        } 
        void println(int x){ 
            static char s[15],*s1;s1=s; 
            if (!x)*s1++='0';if (x<0)out('-'),x=-x; 
            while(x)*s1++=x%10+'0',x/=10; 
            while(s1--!=s)out(*s1); out('\n'); 
        } 
        void print(ll x){ 
            static char s[25],*s1;s1=s; 
            if (!x)*s1++='0';if (x<0)out('-'),x=-x; 
            while(x)*s1++=x%10+'0',x/=10; 
            while(s1--!=s)out(*s1); 
        } 
        void println(ll x){ 
            static char s[25],*s1;s1=s; 
            if (!x)*s1++='0';if (x<0)out('-'),x=-x; 
            while(x)*s1++=x%10+'0',x/=10; 
            while(s1--!=s)out(*s1); out('\n'); 
        } 
        void print(double x,int y){ 
            static ll mul[]={1,10,100,1000,10000,100000,1000000,10000000,100000000, 
                1000000000,10000000000LL,100000000000LL,1000000000000LL,10000000000000LL, 
                100000000000000LL,1000000000000000LL,10000000000000000LL,100000000000000000LL}; 
            if (x<-1e-12)out('-'),x=-x;x*=mul[y]; 
            ll x1=(ll)floor(x); if (x-floor(x)>=0.5)++x1; 
            ll x2=x1/mul[y],x3=x1-x2*mul[y]; print(x2); 
            if (y>0){out('.'); for (size_t i=1;i<y&&x3*mul[i]<mul[y];out('0'),++i) {}; print(x3);} 
        } 
        void println(double x,int y){print(x,y);out('\n');} 
        void print(char *s){while (*s)out(*s++);} 
        void println(char *s){while (*s)out(*s++);out('\n');} 
        void flush(){if (p1!=buf){fwrite(buf,1,p1-buf,stdout);p1=buf;}} 
        ~Ostream_fwrite(){flush();} 
    }Ostream; 
    inline void print(int x){Ostream.print(x);} 
    inline void println(int x){Ostream.println(x);} 
    inline void print(char x){Ostream.out(x);} 
    inline void println(char x){Ostream.out(x);Ostream.out('\n');} 
    inline void print(ll x){Ostream.print(x);} 
    inline void println(ll x){Ostream.println(x);} 
    inline void print(double x,int y){Ostream.print(x,y);} 
    inline void println(double x,int y){Ostream.println(x,y);} 
    inline void print(char *s){Ostream.print(s);} 
    inline void println(char *s){Ostream.println(s);} 
    inline void println(){Ostream.out('\n');} 
    inline void flush(){Ostream.flush();}
    #undef ll 
    #undef OUT_SIZE 
    #undef BUF_SIZE 
};
using namespace IO;

struct dical_tree{  //小根堆笛卡尔树,值val满足堆的性质,下标key满足二叉树的性质

    int tot,sta[maxn],root; //sta维护单调值对应的在tree中的下标,tot表示栈顶的下标,root为树根
    struct node{
        int val;
        int fa,ls,rs;
        node(int v=0,int f=0,int l=0,int r=0) {
            val=v;fa=f;ls=l;rs=r;
        }
    }tree[maxn];

    void build(int a[],int n) {
        tot=root=1;
        sta[1]=1;
        tree[1]=node(a[1],0,0,0);
        for(int i=2;i<=n;i++) {
            while(tot&&a[i]<tree[sta[tot]].val)  tot--;//大根堆改为>
            if(tot) {  //此时需要将新建节点替换tot的右儿子，并把之前的右儿子接到新建节点的左儿子身上，以保证下标构成二叉树
                tree[i]=node(a[i],sta[tot],tree[sta[tot]].rs,0);
                tree[tree[sta[tot]].rs].fa=i;
                tree[sta[tot]].rs=i;                        
            }else {
                tree[i]=node(a[i],0,root,0);
                tree[root].fa=i;
                root=i;
            }
            sta[++tot]=i;
        }
    }
}data[2];

int n,a[2][maxn];

bool check(int k)
{
    for(int i=0;i<=1;i++) data[i].build(a[i],k);
    for(int i=1;i<=k;i++) if(!(data[0].tree[i].ls==data[1].tree[i].ls&&data[0].tree[i].rs==data[1].tree[i].rs)) return false;
    return true;
}

int main()
{
    //freopen("/Users/wzw/Desktop/ACM/1.in","r",stdin);
    while(read(n)){
        for(int i=0;i<=1;i++) for(int j=1;j<=n;j++) read(a[i][j]);
        int l=1,r=n+1;
        while(l+1<r) {
            int mid=(l+r)>>1;
            if(check(mid)) l=mid;
            else r=mid;
        }
        printf("%d\n",l);
    }
}