Can you answer these queries?
Time Limit:2000MS Memory Limit:65768KB 64bit IO Format:%I64d & %I64u
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.
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 63.
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.
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 63.
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
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
19
7
6
解题思路：刚开始看到题目的时候感觉蛮简单的，就是类似区间增减的感觉。但是慢慢写着写着感觉没法写了。于是就看了看网上别人的思路，发现原来平方藏有玄机。2^64如果要开方的话，最多也就开7次，所以记录每个结点所管辖叶子结点最少已经开了多少次方，就能省下很多的更新时间，如果能开方，就找到叶子结点进行开方操作，而询问就是简单的区间求和了。还有比较坑的就是X,Y大小关系没有说。
#include<stdio.h>
#include<algorithm>
#include<math.h>
#include<string.h>
using namespace std;
const int maxn = 120000;
const int INF = 0x3f3f3f3f;
typedef long long INT;
#define mid (L+R)/2
#define lson rt*2,L,mid
#define rson rt*2+1,mid+1,R
struct SegTree{
INT val;
int coun;
}segs[maxn*4];
void PushUp(int rt){
segs[rt].val = segs[rt*2].val + segs[rt*2+1].val;
segs[rt].coun = min(segs[rt*2].coun,segs[rt*2+1].coun);
}
void buildtree(int rt,int L,int R){
segs[rt].coun = 0;
if(L == R){
scanf("%lld",&segs[rt].val);
return;
}
buildtree(lson);
buildtree(rson);
PushUp(rt);
}
void Update(int rt,int L,int R,int l_ran,int r_ran){
if(segs[rt].coun >= 8){
return ;
}
if(L == R){
segs[rt].val = (INT)sqrt(segs[rt].val);
segs[rt].coun++;
return;
}
if(l_ran <= mid)
Update(lson,l_ran,r_ran);
if(r_ran > mid)
Update(rson,l_ran,r_ran);
PushUp(rt);
}
INT query(int rt,int L,int R,int l_ran,int r_ran){
if(l_ran <= L && R <= r_ran){
return segs[rt].val;
}
INT ret = 0;
if(l_ran <= mid){
ret += query(lson,l_ran,r_ran);
}
if(r_ran > mid){
ret += query(rson,l_ran,r_ran);
}
return ret;
}
int main(){
int cas = 0, n , m;
while(scanf("%d",&n)!=EOF){
buildtree(1,1,n);
scanf("%d",&m);
printf("Case #%d:\n",++cas);
int c, u , v;
for(int i = 1; i <= m; i++){
scanf("%d%d%d",&c,&u,&v);
if(u > v){
swap(u,v);
}
if(c == 0){
Update(1,1,n,u,v);
}else{
INT res = query(1,1,n,u,v);
printf("%lld\n",res);
}
}puts("");
}
return 0;
}