Pagini recente » Cod sursa (job #1733577) | Cod sursa (job #564841) | Cod sursa (job #1778573) | Cod sursa (job #2128148) | Cod sursa (job #2085743)
#include <fstream>
using namespace std;
ifstream cin ("aib.in");
ofstream cout ("aib.out");
int n,m,arb[800001],val,poz;
void up_date (int st,int dr,int nod)
{
if(st==dr && poz==st)
arb[nod]+=val;
else
{
int mij=(st+dr)/2;
if(poz<=mij) up_date(st,mij,nod*2);
else up_date(mij+1,dr,nod*2+1);
arb[nod]=arb[nod*2]+arb[nod*2+1];
}
}
int query (int st,int dr,int nod)
{
if(poz<=st && dr<=val) return arb[nod];
else
{
int mij=(st+dr)/2,r1=0,r2=0;
if(poz<=mij) r1=query(st,mij,nod*2);
if(val>mij) r2=query(mij+1,dr,nod*2+1);
return r1+r2;
}
}
int query2 (int st,int dr,int nod)
{
if(st==dr)
{
if(poz+arb[nod]==val) return st; else return -1;
}
else
{
int mij=(st+dr)/2;
if(poz+arb[nod*2]>=val) return query2(st,mij,nod*2);
else {poz=poz+arb[nod*2]; return query2(mij+1,dr,nod*2+1);}
}
}
void read ()
{
cin>>n>>m;
for(int i=1;i<=n;i++)
{
cin>>val; poz=i;
up_date(1,n,1);
}
}
void solve ()
{
int p;
for(int i=1;i<=m;i++)
{
cin>>p;
if(p!=2) cin>>poz>>val; else cin>>val,poz=0;
if(p==0) up_date(1,n,1);
else if(p==1) cout<<query(1,n,1)<<"\n";
else if(p==2) cout<<query2(1,n,1)<<"\n";
}
}
int main()
{
read();
solve();
cin.close();
cout.close();
return 0;
}