注意到任意一个正数经过不超过5次操作就变成1,之后就不变了;0经过永远不变。那么可以用一个链表来表示某一个数之后的第一个>1的数,然后用并查集来合并即可。
AC代码如下:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#define N 100005
#define ll long long
using namespace std;
int n,m,a[N],fa[N]; ll c[N];
int read(){
int x=0; char ch=getchar();
while (ch<'0' || ch>'9') ch=getchar();
while (ch>='0' && ch<='9'){ x=x*10+ch-'0'; ch=getchar(); }
return x;
}
int getfa(int x){ return (x==fa[x])?x:fa[x]=getfa(fa[x]); }
void ins(int x,int t){
for (; x<=n; x+=x&-x) c[x]+=t;
}
ll getsum(int x){
ll t=0; for (; x; x-=x&-x) t+=c[x]; return t;
}
int main(){
n=read(); int i;
for (i=1; i<=n; i++){
a[i]=read(); ins(i,a[i]); fa[i]=i;
}
fa[n+1]=n+1;
m=read(); int k,x,y;
while (m--){
k=read(); x=read(); y=read();
if (k==1) printf("%lld\n",getsum(y)-getsum(x-1)); else{
for (i=getfa(x); i<=y; i=getfa(i+1)){
ins(i,-a[i]); a[i]=(int)sqrt(a[i]); ins(i,a[i]);
if (a[i]<2) fa[i]=getfa(i+1);
}
}
}
return 0;
}
by lych
2016.4.6