HDU4027 Can you answer these queries? —— 线段树 区间修改

题目链接：https://vjudge.net/problem/HDU-4027

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.

InputThe 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. 
OutputFor 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

题解：

1.因为对区间的操作是：对每个数进行开根，所以不能像以前加减操作那样，也直接对区间的和进行操作（因为：a+b=sum 不能推出 根号（a）+根号（b） = 根号（a+b））。

2.根据上一点，所以在线段树中，我们只能对一段区间一直更新到每一个元素，然后再push_up求和。但是，如果每个操作都如此，那复杂度得多大？直接用数组维护比线段树更快，那要线段树何用？

3.再回看题目，数据最大为2^64，然后操作是对其开根，我们可以知道对1开根还是1，即当一个值是1时，我们不需要对其进行操作了。推广到一个区间：如果这个区间的所有元素都为1，那么我们也不需要再对这个区间进行操作。那么我们对2^64逐次开根：2^32 2^16 2^8 2^8 2^4 2^2 2^1 1，可以发现，一个数最多只需开7次根就会变成1，操作量很小了。所以：利用线段树进行维护，当一段区间的所有元素都为1，那么我们直接返回；否则更新至叶子结点（深入到每个元素）。

代码如下：

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <cmath>
 #include <algorithm>
 #include <vector>
 #include <queue>
 #include <stack>
 #include <map>
 #include <string>
 #include <set>
 using namespace std;
 typedef long long LL;
 const double EPS = 1e-;
 const int INF = 2e9;
 const LL LNF = 2e18;
 const int MAXN = 1e5+;

 LL sum[MAXN<<];

 void push_up(int u)
 {
     sum[u] = sum[u*] + sum[u*+];
 }

 void build(int u, int l, int r)
 {
     if(l==r)
     {
         scanf("%lld", &sum[u]);
         return;
     }

     int mid = (l+r)>>;
     build(u*, l, mid);
     build(u*+, mid+, r);
     push_up(u);
 }

 void attack(int u, int l, int r, int x, int y)
 {
     if(l==r)
     {
         sum[u] = (LL)sqrt(sum[u]);
         return;
     }
     //如果这段区域的每个值都为1，那么就无需再执行操作了
     if(x<=l && r<=y && sum[u]==1LL*(r-l+)) return;

     int mid = (l+r)>>;
     if(x<=mid) attack(u*, l, mid, x, y);
     if(y>=mid+) attack(u*+, mid+, r, x, y);
     push_up(u);
 }

 LL query(int u, int l, int r, int x, int y)
 {
     if(x<=l && r<=y)
         return sum[u];

     LL ret = ;
     int mid = (l+r)>>;
     if(x<=mid) ret += query(u*, l, mid, x, y);
     if(y>=mid+) ret += query(u*+, mid+, r, x, y);
     return ret;
 }

 int main()
 {
     int n, m, kase = ;
     while(scanf("%d", &n)!=EOF)
     {
         build(, , n);
         scanf("%d", &m);
         printf("Case #%d:\n", ++kase);
         for(int i = ; i<=m; i++)
         {
             LL op, x, y;
             scanf("%lld%lld%lld", &op, &x, &y);
             int xx = min(x, y), yy = max(x, y);
             if(op==) attack(, , n, xx, yy );
             else printf("%lld\n", query(, , n, xx, yy) );
         }
         printf("\n");
     }
 }