Pagini recente » Cod sursa (job #425146) | Cod sursa (job #1925623) | Cod sursa (job #206201) | Cod sursa (job #2416822) | Cod sursa (job #1919505)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("datorii.in");
ofstream g("datorii.out");
int main()
{
int n,m,a[15000],b[100000][3],i,j,s,k;
f>>n>>m;
for(i=1;i<=n;++i)
f>>a[i];
for(i=1;i<=m;++i)
for(j=1;j<=3;++j)
f>>b[i][j];
for(i=1;i<=m;++i)
{
if(b[i][1]==0) a[b[i][2]]-=b[i][3];
else
{ s=0;
for(k=b[i][2];k<=b[i][3];++k)
s+=a[k];
g<<s<<endl;
}
}
return 0;
}