Pagini recente » Cod sursa (job #1368827) | Cod sursa (job #1803438) | Cod sursa (job #1518159) | Clasament pregatire_oji_11-12_3 | Cod sursa (job #1611093)
#include <iostream>
#include <vector>
#include <fstream>
#define MOD 100003
using namespace std;
ifstream in("datorii.in");
ofstream out("datorii.out");
int n, m, v[15001],i, x, a, b, op;
int main()
{
in>>n>>m;
in>>v[1];
for(i=2;i<=n;i++)
{
in>>x;
v[i]=x+v[i-1];
}
for(i=1;i<=m;i++)
{
in>>op>>a>>b;
if(op==1)
out<<v[b]-v[a-1]<<'\n';
else
{
for(int j=a;j<=n;j++)
v[j]-=b;
}
}
return 0;
}