HDU 4027 Can you answer these queries? (线段树变着花样让你区间更新)

题意：给一个数组序列， 数组长度为100000，现在有两种操作， 一种操作是将某一个固定区间所有数开方（向下取整），另一种操作是询问某个区间的所有数字之和。

坑点：区间的左右不是按顺序给的（RE的原因）

思路：

单点更新到子叶节点肯定药丸 1e5*1e5（TLE的原因）。

所以考虑使用区间更新。

这个题的更新操作是对子叶节点开方，而子叶节点的最小值是1。

就是说区间的最小值就是right-left+1，再怎么更新都不会更小了。

所以可以剪一枝，即当区间的值为最小值为right-left+1就不用向下更新了，return。

代码：

#include <bits/stdc++.h>

using namespace std;
const int MAXN=100000+5;
long long a[MAXN];
int ppp,st,en;
long long tree[3*MAXN+10],ans;
void build(int root,int left,int right){
    int mid=(left+right)/2;
    if(left==right){
        tree[root]=a[++ppp];
        return ;
    }else{
        build(root*2,left,mid);
        build(root*2+1,mid+1,right);
    }
    tree[root]=tree[root*2]+tree[root*2+1];
    return ;
}
void update(int root,int left,int right){
    if(tree[root]==(right-left+1)) return ;//剪枝在这:）
    int mid=(left+right)/2;
    if(left==right){
        tree[root]=(long long)(sqrt(tree[root]));
        return ;
    }else if(mid<st){
        update(root*2+1,mid+1,right);
    }else if(mid>=en){
        update(root*2,left,mid);
    }else{
        update(root*2,left,mid);
        update(root*2+1,mid+1,right);
    }
    tree[root]=tree[root*2]+tree[root*2+1];
    return ;
}
void query(int root,int left,int right){
    int mid=(left+right)/2;
    if(left>=st&&right<=en){
        ans+=tree[root];
        return ;
    }else if(mid<st){
        query(root*2+1,mid+1,right);
    }else if(mid>=en){
        query(root*2,left,mid);
    }else{
        query(root*2,left,mid);
        query(root*2+1,mid+1,right);
    }
    tree[root]=tree[root*2]+tree[root*2+1];
    return ;

}
int main()
{
    int n,cut=0;
    while(~scanf("%d",&n)){
        printf("Case #%d:\n",++cut);
        for(int i=0;i<n;i++)
            scanf("%lld",&a[i]);
        int m;
        scanf("%d",&m);
        ppp=-1;
        build(1,1,n);
        int x,y,z;
        while(m--){
            scanf("%d%d%d",&x,&y,&z);
            if(y>z)
                swap(y,z);
            st=y;
            en=z;
            if(x==1){
                ans=0;
                query(1,1,n);
                printf("%lld\n",ans);
            }else{
                update(1,1,n);
            }
        }
        cout<<endl;
    }
}

Description

A lot of battleships of evil are arranged in a line before the battle. Our commander decides to use our secret weapon to eliminate the battleships. Each of the battleships can be marked a value of endurance. For every attack of our secret weapon, it could decrease the endurance of a consecutive part of battleships by make their endurance to the square root of it original value of endurance. During the series of attack of our secret weapon, the commander wants to evaluate the effect of the weapon, so he asks you for help. 
You are asked to answer the queries that the sum of the endurance of a consecutive part of the battleship line. 

Notice that the square root operation should be rounded down to integer.

Input

The input contains several test cases, terminated by EOF. 
  For each test case, the first line contains a single integer N, denoting there are N battleships of evil in a line. (1 <= N <= 100000) 
  The second line contains N integers Ei, indicating the endurance value of each battleship from the beginning of the line to the end. You can assume that the sum of all endurance value is less than 2  ⁶³. 
  The next line contains an integer M, denoting the number of actions and queries. (1 <= M <= 100000) 
  For the following M lines, each line contains three integers T, X and Y. The T=0 denoting the action of the secret weapon, which will decrease the endurance value of the battleships between the X-th and Y-th battleship, inclusive. The T=1 denoting the query of the commander which ask for the sum of the endurance value of the battleship between X-th and Y-th, inclusive. 

Output

For each test case, print the case number at the first line. Then print one line for each query. And remember follow a blank line after each test case.

Sample Input

10
1 2 3 4 5 6 7 8 9 10
5
0 1 10
1 1 10
1 1 5
0 5 8
1 4 8

Sample Output

Case #1:
19
7
6