codevs2492 上帝造题的七分钟2 BZOJ3211 花神游历各国

#include <cstdio>#include <cmath>#include <iostream>#include <algorithm>using namespace std;typedef long long LL;LL a[100005],c[100005];int f[100005],n,m,op,l,r,t;int find(int x){return x==f[x]?x:f[x]=find(f[x]);}int update(int x,LL num){while(x<=n)c[x]+=num,x+=(x&-x);}LL sum(int x){LL s=0;while(x)s+=c[x],x-=(x&-x);return s;}int main(){    scanf("%d",&n);    for(int i=1;i<=n;i++)f[i]=i,scanf("%lld",&a[i]),update(i,a[i]);    scanf("%d",&m); f[n+1]=n+1;    for(int i=1;i<=m;i++){        scanf("%d%d%d",&op,&l,&r);        if(l>r)swap(l,r);        if(op==1)printf("%lld\n",(sum(r)-sum(l-1)));        else for(int j=l;j<=r;update(j,(t=(int)sqrt(a[j]))-a[j]),a[j]=t,f[j]=(a[j]<=1)?j+1:j,j=(find(j)==j?j+1:f[j]));    }    return 0;    }