题意
给你一个长度为 n n n的序列,两种操作将一段区间中的数开平方,询问一段区间中数的和。
分析
a [ i ] ≤ 1 e 12 a[i]\le1e^{12} a[i]≤1e12,最多六次就可变成1,在区间中使用线段树维护一个最大值,当前区间最大值为1是不在进行更新,其他情况暴力更新到单点。
实现与普通线段树类似,暴力更新到单点并剪枝的思想很重要!!
代码
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
#define endl '\n'
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
void input() {
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
}
const ll N = 1e6 + 10, M = N * 2, inf = 1e8;
struct Node {
ll l, r, cnt;
ll v, maxm;
} tr[N * 4];
ll n, m, a[N];
void pushup(ll u) {
tr[u].v = tr[u << 1].v + tr[u << 1 | 1].v;
tr[u].maxm = max(tr[u<<1].maxm, tr[u<<1|1].maxm);
}
void build(ll u, ll l, ll r) {
tr[u].l = l, tr[u].r = r, tr[u].v = 0;
if (l == r) {
tr[u].v = a[l];
tr[u].maxm = a[l];
} else {
ll mid = (l + r) >> 1;
build(u << 1, l, mid);
build(u << 1 | 1, mid + 1, r);
pushup(u);
}
}
void update(ll u, ll l, ll r) {
if(tr[u].maxm == 1) return;
if (tr[u].l == tr[u].r) {
tr[u].cnt ++;
tr[u].v = sqrt(tr[u].v);
tr[u].maxm = tr[u].v;
} else {
ll mid = (tr[u].l + tr[u].r) >> 1;
if (l <= mid) update(u << 1, l, r);
if (r > mid) update(u << 1 | 1, l, r);
pushup(u);
}
}
ll query(ll u, ll l, ll r) {
if (l <= tr[u].l && tr[u].r <= r) {
return tr[u].v;
} else {
ll mid = (tr[u].l + tr[u].r) >> 1, res = 0;
if (l <= mid) res += query(u << 1, l, r);
if (r > mid) res += query(u << 1 | 1, l, r);
return res;
}
}
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin>>n;
for(ll i = 1; i <= n; i++) cin>>a[i];
build(1, 1, n);
cin>>m;
while(m--){
ll op, l, r; cin>>op>>l>>r;
if(l >= r) swap(l, r);
if(op == 1){
cout<<query(1, l, r)<<endl;
}else{
update(1, l, r);
}
}
return 0;
}