分析：水题
每次安装的时候和根节点求lca的过程中区间覆盖+区间查询
每次删除的时候查询子树中安装的数量+区间覆盖
附上代码：
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <queue>
#include <iostream>
#include <cstdlib>
using namespace std;
#define N 100005
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
struct node
{int to,next;
}e[N<<1];
int head[N],cnt,dep[N],fa[N],anc[N],siz[N],son[N],sum[N<<2],cov[N<<2],n,Q,idx[N],tims;
char s[20];
void add(int x,int y)
{e[cnt].to=y;e[cnt].next=head[x];head[x]=cnt++;return ;
}
void dfs1(int x,int from)
{dep[x]=dep[from]+1,siz[x]=1,fa[x]=from;for(int i=head[x];i!=-1;i=e[i].next){int to1=e[i].to;if(to1!=from){dfs1(to1,x);siz[x]+=siz[to1];if(siz[son[x]]<siz[to1])son[x]=to1;}}
}
void dfs2(int x,int top)
{idx[x]=++tims;anc[x]=top;if(son[x])dfs2(son[x],top);for(int i=head[x];i!=-1;i=e[i].next){int to1=e[i].to;if(to1!=son[x]&&to1!=fa[x])dfs2(to1,to1);}
}
void PushUp(int rt)
{sum[rt]=sum[rt<<1]+sum[rt<<1|1];
}
void PushDown(int rt,int m)
{if(cov[rt]!=-1){cov[rt<<1]=cov[rt<<1|1]=cov[rt];sum[rt<<1]=(m-(m>>1))*cov[rt];sum[rt<<1|1]=(m>>1)*cov[rt];cov[rt]=-1;return ;}
}
void build(int l,int r,int rt)
{cov[rt]=-1;if(l==r){sum[rt]=1;return ;}int m=(l+r)>>1;build(lson);build(rson);PushUp(rt);
}
void Update(int L,int R,int c,int l,int r,int rt)
{if(L<=l&&r<=R){cov[rt]=c;sum[rt]=c*(r-l+1);return ;}PushDown(rt,r-l+1);int m=(l+r)>>1;if(m>=L)Update(L,R,c,lson);if(m<R)Update(L,R,c,rson);PushUp(rt);
}
int query(int L,int R,int l,int r,int rt)
{if(L<=l&&r<=R)return sum[rt];PushDown(rt,r-l+1);int m=(l+r)>>1,ret=0;if(m>=L)ret+=query(L,R,lson);if(m<R)ret+=query(L,R,rson);return ret;
}
int Install(int x)
{int ret=0;while(x){ret+=query(idx[anc[x]],idx[x],1,n,1);//printf("%d %d %d\n",idx[anc[x]],idx[x],ret);Update(idx[anc[x]],idx[x],0,1,n,1);x=fa[anc[x]];}return ret;
}
int Uninstall(int x)
{int ret=siz[x]-query(idx[x],idx[x]+siz[x]-1,1,n,1);//printf("%d %d\n",idx[x],idx[x]+siz[x]-1);Update(idx[x],idx[x]+siz[x]-1,1,1,n,1);return ret;
}
int main()
{memset(head,-1,sizeof(head));scanf("%d",&n);build(1,n,1);for(int i=2;i<=n;i++){int x;scanf("%d",&x);x++;add(x,i);add(i,x);}dfs1(1,0);dfs2(1,1);scanf("%d",&Q);while(Q--){int x;scanf("%s%d",s,&x);x++;if(s[0]=='i'){printf("%d\n",Install(x));}else{printf("%d\n",Uninstall(x));}}return 0;
}
