Cod sursa(job #2350492)
Utilizator | Data | 21 februarie 2019 14:22:23 | |
---|---|---|---|
Problema | Datorii | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.65 kb |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int const maxim=16000;
ll vector1[maxim];
ll contor=0;
int main(){
int n,m;
ifstream in("datorii.in");
ofstream out("datorii.out");
in>>n >> m;
for(int i=1;i<=n;i++){
int a;
in >> a;
vector1[i]=a;
}
int a,b,c,suma1=0,suma2=0;
for(int i=1;i<=m;i++){
in >> a >> b >> c;
suma1=0,suma2=0;
if(a){
while(c>=b){
suma1+=vector1[c];
c--;
}
out << suma1 << endl;
}
else{
vector1[b]-=c;
}
}
return 0;
}