Pagini recente » Rating Maxim Adelutza (adelutza) | Cod sursa (job #3208855) | Cod sursa (job #401686) | Cod sursa (job #527133) | Cod sursa (job #716921)
Cod sursa(job #716921)
#include<fstream>
using namespace std;
int n,m,A[15001];
ofstream g("datorii.out");
struct b
{
int ii,x,y;
}B[100001];
void monstru()
{
ifstream f("datorii.in");
f>>n>>m;
int i;
for(i=1;i<=n;i++)
f>>A[i];
for(i=1;i<=m;i++)
f>>B[i].ii>>B[i].x>>B[i].y;
}
int BB(int a, int b)
{
int i,k=0;
for(i=a;i<=b;i++)
k+=A[i];
return k;
}
void sistem()
{
int i,p;
for(i=1;i<=m;i++)
if(B[i].ii==0)
{
if(A[B[i].x]>=B[i].y)
A[B[i].x]-=B[i].y;
}
else
{
p=BB(B[i].x,B[i].y);
g<<p<<'\n';
}
}
int main(void)
{
monstru();
sistem();
g.close();
return 0;
}