Submission

PPTTTTTTTTTTTTTTTTTT

Score: 10

User: real_MYdkn_not_fake_100

Problemset: ผลบวก (ยาก)

Language: cpp

Time: 0.201 second

Submitted On: 2024-11-11 09:00:15

#include <bits/stdc++.h>
using namespace std;

int mem[int(10e6+5)];
int base[int(10e6+5)];
int main(){
    int n;
    cin>>n;
    for(int i=0;i<n;++i){
        cin>>base[i];
        if(i==0){
            mem[i]=base[i];
            continue;
        }
        mem[i]=mem[i-1]+base[i];
    }

    int m;
    cin>>m;

    for(int i=0;i<m;++i){
        int p;
        cin>>p;
        for(int j=0;j<p;++j){
            int idx, change_to;
            cin>>idx>>change_to;
            int change=change_to-base[idx];
            base[idx]=change_to;
            for(int k=idx;k<n;++k){
                mem[k]+=change;
            }
        }
        int s,f;
        cin>>s>>f;
        cout<<mem[f]-mem[s-1]<<"\n";
    }
    
    // for(int i=0;i<n;++i){
    //     cout<<mem[i]<<" ";
    // }

    return 0;
}