Pagini recente » Cod sursa (job #3226025) | Cod sursa (job #1109974) | Cod sursa (job #1159092) | Cod sursa (job #1877686) | Cod sursa (job #3133776)
#include <fstream>
using namespace std;
ifstream f("datorii.in");
ofstream g("datorii.out");
int main()
{
int n, m, i, j, v[15001], y, z, s;
bool x;
f >> n >> m;
v[0] = 0;
for (i = 1; i <= n; i++)
{
f >> v[i];
v[i] += v[i-1];
}
for (i = 0; i < m; i++)
{
f >> x >> y >> z;
if (x == 0)
for (j = y; j <= n; j++)
v[j] -= z;
if (x == 1)
g << v[y] - v[x-1] << '\n';
}
return 0;
}