Cod sursa(job #3292476)
| Utilizator | Data | 8 aprilie 2025 13:02:21 | |
|---|---|---|---|
| Problema | Datorii | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.68 kb |
#include <bits/stdc++.h>
#include <numeric>
using namespace std;
ifstream in("datorii.in");
ofstream out("datorii.out");
int main() {
int n, m;
in >> n >> m;
vector<int> s(n+1);
for (int i = 1; i <= n; i++) {
int ai;
in >> ai;
s[i] = s[i-1] + ai;
}
vector<int> v(n+1);
while (m--) {
int o, p, q;
in >> o >> p >> q;
if (o == 0) {
for (int i = p; i <= n; i++) {
v[i] += q;
}
} else if (o == 1) {
int sol = s[q] - s[p-1] - v[q] + v[p-1];
out << sol << "\n";
}
}
return 0;
}