# HDU - Can you answer these queries?(线段树)

Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)

## Problem 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 263.
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

Case #1:
19
7
6

## Problem solving report:

Description: 有两种操作:0代表将x与y之间的数变成√ai, 1代表求出x与y之间中所有数的和。
Problem solving: 线段树模板，稍微改变一下条件。因为1开根号还是1，故可以把结果为1的标记上，避免无用的计算。注意x不一定比y小。

Accepted Code:

/*
* @Author: lzyws739307453
* @Language: C++
*/
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
struct Tree {
bool vis;
long long val;
}seg[MAXN << 2];
void PushUp(int rt) {
seg[rt].vis = seg[rt << 1].vis && seg[rt << 1 | 1].vis;
seg[rt].val = seg[rt << 1].val + seg[rt << 1 | 1].val;
}
void Create(int l, int r, int rt) {
seg[rt].vis = false;
if (!(r - l)) {
scanf("%lld", &seg[rt].val);
return ;
}
int mid = l + (r - l >> 1);
Create(l, mid, rt << 1);
Create(mid + 1, r, rt << 1 | 1);
PushUp(rt);
}
void Update(int Ql, int Qr, int l, int r, int rt) {
if (seg[rt].vis)
return ;
if (!(r - l)) {
seg[rt].val = sqrt(seg[rt].val);
if (!(seg[rt].val != 1))
seg[rt].vis = true;
return ;
}
int mid = l + (r - l >> 1);
if (Ql <= mid)
Update(Ql, Qr, l, mid, rt << 1);
if (Qr > mid)
Update(Ql, Qr, mid + 1, r, rt << 1 | 1);
PushUp(rt);
}
long long Query(int Ql, int Qr, int l, int r, int rt) {
if (Ql <= l && Qr >= r)
return seg[rt].val;
long long ans = 0;
int mid = l + (r - l >> 1);
if (Ql <= mid)
ans += Query(Ql, Qr, l, mid, rt << 1);
if (Qr > mid)
ans += Query(Ql, Qr, mid + 1, r, rt << 1 | 1);
return ans;
}
int main() {
int n, m;
int l, r, op, kase = 0;
while (~scanf("%d", &n)) {
Create(1, n, 1);
scanf("%d", &m);
printf("Case #%d:\n", ++kase);
while (m--) {
scanf("%d%d%d", &op, &l, &r);
if (l > r)
swap(l, r);
if (!op)
Update(l, r, 1, n, 1);
else printf("%lld\n", Query(l, r, 1, n, 1));
}
printf("\n");
}
return 0;
}


05-13 294

04-06 596

05-29 1130

03-16 249

08-16 188

11-10 3183

08-01 356

07-27 819

01-15 176

05-17 109

09-13 516

03-30 620

03-14 131

07-28 51

05-11 730

#### C/C++学习指南全套教程

09-11
©️2020 CSDN 皮肤主题: 代码科技 设计师: Amelia_0503

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、C币套餐、付费专栏及课程。