Cod sursa(job #2267119)
Utilizator | Ben Test BRIOI19 | Data | 23 octombrie 2018 12:04:27 |
---|---|---|---|
Problema | Datorii | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.66 kb |
#include <iostream>
#include <fstream>
using namespace std;
long long prefix[15010];
int main() {
ifstream fin("datorii.in");
ofstream fout("datorii.out");
int n,m;
fin>>n>>m;
int arr[n+1];
for(int i=1;i<=n;i++){
fin>>arr[i];
prefix[i] = prefix[i-1]+arr[i];
}
while(m--){
int x;
fin>>x;
if(x == 0){
int t,v;
fin>>t>>v;
arr[t]-=v;
for(int i=t;i<=n;i++){
prefix[i] = prefix[i-1]+arr[i];
}
}
if(x==1){
long long res = 0;
int l,r;
fin>>l>>r;
fout<<prefix[r] - prefix[l-1]<<endl;
}
}
}