Pagini recente » Cod sursa (job #809582) | Cod sursa (job #2653999) | Cod sursa (job #887996) | Cod sursa (job #992660) | Cod sursa (job #344493)
Cod sursa(job #344493)
#include <stdio.h>
using namespace std;
int main() {
int n, m, p[15000],k=0, inceput[15000], plata[15000], i, j, x, y, z, s=0;
FILE *f1 = fopen("datorii.in", "r");
FILE *f2 = fopen("datorii.out", "w");
fscanf(f1, "%d%d", &n, &m);
p[0]=0;
for(i=1; i<=n; i++) {
fscanf(f1, "%d", &j);
p[i]=p[i-1]+j;
}
for(i=1; i<=m; i++) {
fscanf(f1, "%d%d%d", &x, &y, &z);
if(x==0) {
//a[y]-=z;
//for(j=y;j<=n;j++) { p[j]-=z; }
k++; inceput[k]=y; plata[k]=z;
}
else {
s=p[z]-p[y-1];
for(j=1;j<=k;j++) {
s=s-(n-inceput[j]-1)*plata[j];
}
fprintf(f2, "%d\n", s);
s=0;
}
}
fclose(f1);
fclose(f2);
return 0;
}