Pagini recente » Cod sursa (job #1640794) | Cod sursa (job #2670239) | Cod sursa (job #345788) | Cod sursa (job #2806827) | Cod sursa (job #792856)
Cod sursa(job #792856)
#include <fstream>
using namespace std;
int zile[15000];
int p[15000];
int main()
{
ifstream in("datorii.in");
ofstream out("datorii.out");
int n,i,j,x,y,s,w,u,o,z,m;
in>>n>>m;
for (i=0;i<n;i++)
{
in>>zile[i];
}
for (i=0;i<m;i++)
{
in>>x;
in>>y;
in>>z;
y=y-1;
if(x==0)
{
p[y]=p[y]+z;
}
if (x==1)
{
for (w=0;w<n;w++)
{
zile[w]=zile[w]-p[w];
}
for (w=0;w<n;w++)
{
p[w]=0;
}
s=0;
for (w=y;w<z;w++)
{
s=s+zile[w];
}
out<<s<<endl;
}
}
in.close();
out.close();
return 0;
}