BZOJ3211 花神游历各国

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cctype>
#include<cmath>
#define rep(s,t) for(int i=s;i<=t;i++)
#define ren for(int i=first[x];i!=-1;i=next[i])
using namespace std;
typedef long long ll;
inline ll read() {
    ll x=0,f=1;char c=getchar();
    for(;!isdigit(c);c=getchar()) if(c==‘-‘) f=-1;
    for(;isdigit(c);c=getchar()) x=x*10+c-‘0‘;
    return x*f;
}
const int maxn=100010;
int n,fa[maxn],A[maxn];
inline int findset(int x) {return !fa[x]||x==fa[x]?x:fa[x]=findset(fa[x]);}
ll c[maxn];
void add(int x,ll v) {for(;x<=n;x+=x&-x) c[x]+=v;}
ll sum(int x) {ll ret=0;for(;x;x-=x&-x) ret+=c[x];return ret;}
int main() {
    n=read();
    rep(1,n) {
        add(i,A[i]=read());
        if(A[i]<=1) fa[i]=i+1;
    }
    int q=read();
    while(q--) {
        int t=read(),l=read(),r=read();
        if(t==1) printf("%lld\n",sum(r)-sum(l-1));
        else {
            for(int i=findset(l);i<=r;i=findset(i+1)) {
                int t=sqrt(A[i]);
                add(i,t-A[i]);A[i]=t;
                if(A[i]<=1) fa[i]=findset(i+1);
            }
        }
    }
    return 0;
}