Pagini recente » Cod sursa (job #3181777) | Cod sursa (job #2288258) | Cod sursa (job #236977) | Cod sursa (job #2739894) | Cod sursa (job #1807956)
#include <fstream>
using namespace std;
ifstream in("datorii.in");
ofstream out("datorii.out");
const int Max = 15007;
int n, m;
int v[Max];
int main()
{
in >> n >> m;
for(int i = 1; i<= n; ++i)
{
in >> v[i];
}
int tur, x, y, s;
for(;m; --m)
{
in >> tur >> x >> y;
switch(tur)
{
case 0:
v[x]-= y;
break;
case 1:
s = 0;
for(int j = x; j <= y; ++j)
{
s+= v[j];
}
out << s << "\n";
break;
}
}
}