bzoj3211: 花神游历各国

题目
树状数组+并查集

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=100002;
int n,i,v[N],fa[N],m,opt,l,r,tmp;
ll tr[N];
inline char gc(){
	static char buf[100000],*p1=buf,*p2=buf;
	return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline int rd(){
	int x=0,fl=1;char ch=gc();
	for (;ch<48||ch>57;ch=gc())if(ch=='-')fl=-1;
	for (;48<=ch&&ch<=57;ch=gc())x=(x<<3)+(x<<1)+(ch^48);
	return x*fl;
}
inline void wri(ll a){if(a>=10)wri(a/10);putchar(a%10|48);}
inline void wln(ll a){if(a<0)a=-a,putchar('-');wri(a),puts("");}
int find(int x){return x==fa[x]?x:fa[x]=find(fa[x]);}
void add(int x,int y){
	for (;x<=n;x+=x&-x) tr[x]+=y;
}
ll query(int x){
	ll s=0;
	for (;x;x^=x&-x) s+=tr[x];
	return s;
}
int main(){
	n=rd();
	for (i=1;i<=n;i++) v[i]=rd(),fa[i]=i,add(i,v[i]);
	fa[n+1]=n+1;
	for (m=rd();m--;){
		opt=rd(),l=rd(),r=rd();
		if (opt==1) wln(query(r)-query(l-1));
		else{
			for (i=find(l);i<=r;i=find(i+1)){
				tmp=v[i];
				add(i,(v[i]=sqrt(v[i]))-tmp);
				if (v[i]<=1) fa[i]=find(i+1);
			}
		}
	}
}