Can you answer these queries?（区间修改+区间查询）

题目链接： Can you answer these queries?

---

大致题意:

给一个正整数n，有两种操作

1.使区间[l,r]中的每一个数开方

2.查询区间[l,r]的和

---

解题思路:

区间修改+区间查询

---

AC代码:

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;
int n, m;
ll w[N];
struct node {
	int l, r;
	ll sum;
}t[N << 2];
void pushup(int index) {
	t[index].sum = t[index << 1].sum + t[index << 1 | 1].sum;
}
void build(int l, int r, int index = 1) {
	t[index] = { l,r,w[l] };
	if (l == r)return;
	int mid = l + r >> 1;
	build(l, mid, index << 1); build(mid + 1, r, index << 1 | 1);
	pushup(index);
}
ll ask(int l, int r, int index = 1) {
	if (t[index].l >= l && t[index].r <= r)return t[index].sum;
	int mid = t[index].l + t[index].r >> 1;
	ll res = 0;
	if (l <= mid)res += ask(l, r, index << 1);
	if (r > mid)res += ask(l, r, index << 1 | 1);
	return res;
}
void modify(int l, int r, int index = 1) {
	if (t[index].sum == t[index].r - t[index].l + 1)return;
	if (t[index].l == t[index].r) {
		t[index].sum = sqrt(t[index].sum);
		return;
	}
	int mid = t[index].l + t[index].r >> 1;
	if (l <= mid)modify(l, r, index << 1);
	if (r > mid)modify(l, r, index << 1 | 1);
	pushup(index);
}
int main() {
	int T = 1;
	while (~scanf("%d", &n)) {
		for (int i = 1; i <= n; ++i)cin >> w[i];
		build(1, n);
		printf("Case #%d:\n", T++);
		scanf("%d", &m);
		while (m--) {
			int k, l, r; scanf("%d %d %d", &k, &l, &r);
			if (l > r) swap(l, r);
			if (k) printf("%lld\n", ask(l, r));
			else modify(l, r);
		}
		printf("\n");
	}
	return 0;
}

END