Educational Codeforces Round 33 F. Subtree Minimum Query

题目大意

一棵有根树，询问距离点x<=y且在x子树内的点的最小值。

题解

mmp,论线段树开两倍的危害…

一眼树套树裸题，就是子树内dep<=dep[x]+y的点的最小值。
搞遍dfs序，线段树套线段树就行了。第一维下标是dfs序对应的下标，第二维下标是点对应的deep值，存的是对应的最小值

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int read()
{
    char ch=getchar();int f=0,x=1;
    while(ch<'0'||ch>'9'){if(ch=='-') x=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){f=(f<<1)+(f<<3)+ch-'0';ch=getchar();}
    return f*x;
}
int n,m,rt,last;
struct node
{
    int from;
    int to;
    int next;
    int w;
}edge[200005];
int tot,head[500005],r,fa[500005],tar,npos[500005],cnt,sz,pos[500005];
int root[500005],ch[10000005][2],w[10000005],dep[500005],size[500005],a[500005];
void add(int u,int v)
{
    edge[tot].from=u;
    edge[tot].to=v;
    edge[tot].next=head[u];
    head[u]=tot++;
}
void dfs(int x)
{
    //cout<<x<<" ";
    pos[x]=++tar;
    npos[tar]=x;
    size[x]=1;
    for(int i=head[x];i!=-1;i=edge[i].next)
    {
        if(edge[i].to!=fa[x])
        {
            fa[edge[i].to]=x;
            dep[edge[i].to]=dep[x]+1;
            dfs(edge[i].to);
            size[x]+=size[edge[i].to];
        }
    }
}
void insert(int &k,int x,int num,int l,int r)
{
    if(!k)
    {
        k=++sz;w[k]=num;
    }
    else w[k]=min(w[k],num);
    if(l==r) return;
    int mid=l+r>>1;
    if(x<=mid) insert(ch[k][0],x,num,l,mid);
    else insert(ch[k][1],x,num,mid+1,r);
}
void build(int p,int l,int r,int x,int y,int num)
{
    insert(root[p],y,num,1,n);
    if(l==r) return;
    int mid=l+r>>1;
    if(x<=mid) build(p<<1,l,mid,x,y,num);
    else build(p<<1|1,mid+1,r,x,y,num);
}
int query(int p,int l,int r,int x,int y)
{
//  cout<<l<<" "<<r<<endl;
    if(!p) return 2000000000;
    if(l==x&&r==y)
    {
        return w[p];
    }
    int mid=l+r>>1;
    if(y<=mid) return query(ch[p][0],l,mid,x,y);
    else if(x>mid) return query(ch[p][1],mid+1,r,x,y);
    else
    {
        return min(query(ch[p][0],l,mid,x,mid),query(ch[p][1],mid+1,r,mid+1,y));
    }
}
void query(int p,int l,int r,int x,int y,int z,int k)
{
    //cout<<x<<" "<<y<<" "<<z<<endl;
    int mid=l+r>>1;
    if(l==x&&r==y)
    {
        //cout<<x<<" "<<y<<" "<<k<<endl;
        last=min(last,query(root[p],1,n,z,k));
        return;
    }
    if(y<=mid) query(p<<1,l,mid,x,y,z,k);
    else if(x>mid) query(p<<1|1,mid+1,r,x,y,z,k);
    else
    {
        query(p<<1,l,mid,x,mid,z,k);
        query(p<<1|1,mid+1,r,mid+1,y,z,k);
    }
}
int main()
{
    memset(head,-1,sizeof(head));
    n=read();rt=read();
    for(int i=1;i<=n;i++) a[i]=read();
    for(int i=1;i<n;i++)
    {
        int u=read(),v=read();
        add(u,v);
        add(v,u);
    }
    dep[rt]=1;
    dfs(rt);

    for(int i=1;i<=n;i++)
    {
        build(1,1,n,i,dep[npos[i]],a[npos[i]]);
    }
    last=0;
    m=read();
    for(int i=1;i<=m;i++)
    {
        int x=(read()+last)%n+1,y=(read()+last)%n;
        last=2000000000;
        query(1,1,n,pos[x],pos[x]+size[x]-1,dep[x],min(y+dep[x],n));
        printf("%d\n",last);
    }
}