Zengtudor/alg2025
1
0
Fork 0
mirror of https://gitcode.com/Zengtudor/alg2025.git synced 2025-08-21 10:42:07 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

update

Browse Source
This commit is contained in:
Zengtudor 2025-08-18 21:02:52 +08:00
parent 34c1b54467
commit 244f30692c
1 changed files with 13 additions and 15 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

28
src/8/18/segtreerange.cpp
View File

@ -4,7 +4,7 @@
using ll = int64_t;
ll n;
ll n,q;
std::vector<ll> t;
std::vector<ll> v;
std::vector<ll> lazy;
@ -20,7 +20,6 @@ ll create(ll cur,ll l,ll r){
return t[cur];
}
ll rangeadd(ll cur, ll l, ll r, ll ql, ll qr, ll val) {
if (lazy[cur] != 0) {
t[cur] += lazy[cur] * (r - l + 1);
@ -61,7 +60,7 @@ ll rangequery(ll cur, ll l, ll r, ll ql, ll qr) {
}
int main(){
std::cin>>n;
std::cin>>n>>q;
t.resize((n+1)*4);
v.resize(n+1);
lazy.resize((n+1)*4);
@ -69,18 +68,17 @@ int main(){
std::cin>>v[i];
}
create(1, 1, n);
ll q;
std::cin>>q;
while(q--){
ll l, r, val;
std::cin>>l>>r>>val;
rangeadd(1, 1, n, l, r, val);
std::cout << t[1] << "\n";
}
std::cin>>q;
while(q--){
ll l, r;
std::cin>>l>>r;
std::cout << rangequery(1, 1, n, l, r) << "\n";
ll op;
std::cin>>op;
if(op==1){
ll x,y,z;
std::cin>>x>>y>>z;
rangeadd(1, 1, n, x, y, z);
}else{
ll x,y;
std::cin>>x>>y;
std::cout<<rangequery(1, 1, n, x, y)<<'\n';
}
}
}