Pagini recente » Cod sursa (job #1221733) | Cod sursa (job #3172744) | Cod sursa (job #2331688) | Cod sursa (job #609192) | Cod sursa (job #3171771)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("datorii.in");
ofstream out("datorii.out");
const int MAX = 15000;
int v[MAX+1], s[MAX+1];
void sumepart (int &n)
{
s[1]=v[1];
for(int i=2; i<=n; ++i)
s[i]=s[i-1]+v[i];
}
int main()
{
int n,m;
in>>n>>m;
for(int i=1; i<=n; ++i)
in>>v[i];
sumepart(n);
int x,y,c;
for(int i=0; i<m; ++i)
{
in>>c>>x>>y;
if(c==1)
{
out<<s[y]-s[x-1]<<'\n';
}
else
{
v[x]=v[x]-y;
sumepart(n);
}
}
return 0;
}