Pagini recente » Cod sursa (job #452261) | Cod sursa (job #1741497) | Cod sursa (job #1114829) | Cod sursa (job #2931421) | Cod sursa (job #962443)
Cod sursa(job #962443)
#include <fstream>
using namespace std;
ifstream in("datorii.in");
ofstream out("datorii.out");
int ma[100001],n,m,i,x,y,g;
void uptd(int nod, int st, int dr)
{
if(st==dr)
{
if(ma[nod]==0){ ma[nod]=y;}
else {ma[nod]=ma[nod]-y;}
return;
}
int mij;
mij=(st+dr)/2;
if(x<=mij){ uptd(nod*2,st,mij);}
else {uptd(nod*2+1,mij+1,dr);}
ma[nod]=ma[2*nod+1]+ma[nod*2];
}
int maxim(int nod, int st, int dr)
{
if(x<=st&&y>=dr) return ma[nod];
int mij,m1,m2;
m1=0; m2=0; mij=(st+dr)/2;
if(x<=mij) m1=maxim(2*nod,st,mij);
if(y>mij) m2=maxim(2*nod+1,mij+1,dr);
return m1+m2;
}
int main()
{
in>>n>>m;
for(i=1;i<=n;i++)
{
in>>y;
x=i;
uptd(1,1,n);
}
for(i=1;i<=m;i++)
{
in>>g>>x>>y;
if(g==0) uptd(1,1,n);
if(g==1)
{
out<<maxim(1,1,n)<<"\n";
}
}
return 0;
}