bzoj4034（树链剖分裸题）

用到了dfs序

以后注意到这样的数据范围直接开ll就可以，1过样例且1A，(＾－＾)V

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
const int N=100005;
inline int read()
{
	int ans,f=1;char ch;
	while ((ch=getchar())<'0'||ch>'9') if (ch=='-') f=-1;ans=ch-'0';
	while ((ch=getchar())>='0'&&ch<='9') ans=ans*10+ch-'0';
	return ans*f;
}

int n,m;
ll val[N];

int fa[N],son[N],top[N],size[N];

int head[N],tot,pre[N*2],to[N*2];
void addedge(int x,int y)
{
	to[++tot]=y;pre[tot]=head[x];head[x]=tot;
}

int id[N],tt,lx[N],rx[N];
struct aa
{
	int l,r;
	ll sum,add;
}a[N*4];

void init()
{
	n=read();m=read();
	for (int i=1;i<=n;i++) val[i]=read();
	int x,y;
	for (int i=1;i<n;i++)
	{
		x=read();y=read();
		addedge(x,y);
		addedge(y,x);
	}
}

void dfs1(int u)
{
	size[u]=1;
	int mx=0;
	for (int i=head[u];i;i=pre[i])
	if (to[i]!=fa[u])
	{
		int v=to[i];
		fa[v]=u;
		dfs1(v);
		size[u]+=size[v];
		if (size[v]>mx) mx=size[v],son[u]=v;
	}
}

void dfs2(int u,int anc)
{
	top[u]=anc;
	id[u]=++tt;
	lx[u]=tt;
	if (son[u]) dfs2(son[u],anc);
	for (int i=head[u];i;i=pre[i])
	{
		int v=to[i];
		if (son[u]==v||fa[u]==v) continue;
		
		dfs2(v,v);
	}
	rx[u]=tt;
}

void build(int i,int l,int r)
{
	a[i].l=l;a[i].r=r;
	if (l==r) return ;
	int mid=(l+r)>>1;
	build(i<<1,l,mid);
	build(i<<1|1,mid+1,r);
}

void down(int i)
{
	if (a[i].add)
	{
		ll x=a[i].add;
		a[i<<1].add+=x;
		a[i<<1|1].add+=x;
		a[i<<1].sum+=(a[i<<1].r-a[i<<1].l+1)*x;
		a[i<<1|1].sum+=(a[i<<1|1].r-a[i<<1|1].l+1)*x;
		
		a[i].add=0;
	}
}
void up(int i)
{
	a[i].sum=0;
	if (a[i<<1].l) a[i].sum+=a[i<<1].sum;
	if (a[i<<1|1].l) a[i].sum+=a[i<<1|1].sum;
}

void updata(int i,int l,int r,ll add)
{
	if (a[i].l==l&&a[i].r==r)
	{
		a[i].sum+=(a[i].r-a[i].l+1)*add;
		a[i].add+=add;
		return ;
	}
	down(i);
	int mid=(a[i].l+a[i].r)>>1;
	if (mid>=r) updata(i<<1,l,r,add);
	else if (mid<l) updata(i<<1|1,l,r,add);
	else updata(i<<1,l,mid,add),updata(i<<1|1,mid+1,r,add);
	up(i);
}

ll query(int i,int l,int r)
{
	if (a[i].l==l&&a[i].r==r)return a[i].sum;
	down(i);
	int mid=(a[i].l+a[i].r)>>1;
	if (mid>=r) return query(i<<1,l,r);
	else if (mid<l) return query(i<<1|1,l,r);
	return query(i<<1,l,mid)+query(i<<1|1,mid+1,r);
}

ll work(int x)
{
	ll ans=0;
	while (top[x]!=1)
	{
		ans+=query(1,id[top[x]],id[x]);
		x=fa[top[x]];
	}
	ans+=query(1,id[1],id[x]);
	return ans;
}

int main()
{
	init();
	dfs1(1);
	dfs2(1,1);
	build(1,1,n);
	for (int i=1;i<=n;i++) updata(1,id[i],id[i],val[i]);
	
	int p,x,y;
	for (int i=1;i<=m;i++)
	{
		p=read();
		switch(p)
		{
			case 1:x=read();y=read();updata(1,id[x],id[x],y);break;
			case 2:x=read();y=read();updata(1,lx[x],rx[x],y);break;
			case 3:x=read();printf("%lld\n",work(x));break;
		}
	}
	
	return 0;
}#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
const int N=100005;
inline int read()
{
	int ans,f=1;char ch;
	while ((ch=getchar())<'0'||ch>'9') if (ch=='-') f=-1;ans=ch-'0';
	while ((ch=getchar())>='0'&&ch<='9') ans=ans*10+ch-'0';
	return ans*f;
}

int n,m;
ll val[N];

int fa[N],son[N],top[N],size[N];

int head[N],tot,pre[N*2],to[N*2];
void addedge(int x,int y)
{
	to[++tot]=y;pre[tot]=head[x];head[x]=tot;
}

int id[N],tt,lx[N],rx[N];
struct aa
{
	int l,r;
	ll sum,add;
}a[N*4];

void init()
{
	n=read();m=read();
	for (int i=1;i<=n;i++) val[i]=read();
	int x,y;
	for (int i=1;i<n;i++)
	{
		x=read();y=read();
		addedge(x,y);
		addedge(y,x);
	}
}

void dfs1(int u)
{
	size[u]=1;
	int mx=0;
	for (int i=head[u];i;i=pre[i])
	if (to[i]!=fa[u])
	{
		int v=to[i];
		fa[v]=u;
		dfs1(v);
		size[u]+=size[v];
		if (size[v]>mx) mx=size[v],son[u]=v;
	}
}

void dfs2(int u,int anc)
{
	top[u]=anc;
	id[u]=++tt;
	lx[u]=tt;
	if (son[u]) dfs2(son[u],anc);
	for (int i=head[u];i;i=pre[i])
	{
		int v=to[i];
		if (son[u]==v||fa[u]==v) continue;
		
		dfs2(v,v);
	}
	rx[u]=tt;
}

void build(int i,int l,int r)
{
	a[i].l=l;a[i].r=r;
	if (l==r) return ;
	int mid=(l+r)>>1;
	build(i<<1,l,mid);
	build(i<<1|1,mid+1,r);
}

void down(int i)
{
	if (a[i].add)
	{
		ll x=a[i].add;
		a[i<<1].add+=x;
		a[i<<1|1].add+=x;
		a[i<<1].sum+=(a[i<<1].r-a[i<<1].l+1)*x;
		a[i<<1|1].sum+=(a[i<<1|1].r-a[i<<1|1].l+1)*x;
		
		a[i].add=0;
	}
}
void up(int i)
{
	a[i].sum=0;
	if (a[i<<1].l) a[i].sum+=a[i<<1].sum;
	if (a[i<<1|1].l) a[i].sum+=a[i<<1|1].sum;
}

void updata(int i,int l,int r,ll add)
{
	if (a[i].l==l&&a[i].r==r)
	{
		a[i].sum+=(a[i].r-a[i].l+1)*add;
		a[i].add+=add;
		return ;
	}
	down(i);
	int mid=(a[i].l+a[i].r)>>1;
	if (mid>=r) updata(i<<1,l,r,add);
	else if (mid<l) updata(i<<1|1,l,r,add);
	else updata(i<<1,l,mid,add),updata(i<<1|1,mid+1,r,add);
	up(i);
}

ll query(int i,int l,int r)
{
	if (a[i].l==l&&a[i].r==r)return a[i].sum;
	down(i);
	int mid=(a[i].l+a[i].r)>>1;
	if (mid>=r) return query(i<<1,l,r);
	else if (mid<l) return query(i<<1|1,l,r);
	return query(i<<1,l,mid)+query(i<<1|1,mid+1,r);
}

ll work(int x)
{
	ll ans=0;
	while (top[x]!=1)
	{
		ans+=query(1,id[top[x]],id[x]);
		x=fa[top[x]];
	}
	ans+=query(1,id[1],id[x]);
	return ans;
}

int main()
{
	init();
	dfs1(1);
	dfs2(1,1);
	build(1,1,n);
	for (int i=1;i<=n;i++) updata(1,id[i],id[i],val[i]);
	
	int p,x,y;
	for (int i=1;i<=m;i++)
	{
		p=read();
		switch(p)
		{
			case 1:x=read();y=read();updata(1,id[x],id[x],y);break;
			case 2:x=read();y=read();updata(1,lx[x],rx[x],y);break;
			case 3:x=read();printf("%lld\n",work(x));break;
		}
	}
	
	return 0;
}