Cod sursa(job #2776398)
Utilizator | Data | 19 septembrie 2021 16:37:55 | |
---|---|---|---|
Problema | Arbori indexati binar | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.88 kb |
#include<fstream>
using namespace std;
ifstream F("aib.in");
ofstream G("aib.out");
int n,m,x,y,z,i,j,s,t,c[100001],a[100001];
int main()
{
F>>n>>m;
for(s=1;s<=n;s<<=1);
for(i=1;i<=n;++i)
F>>a[i],a[i]+=a[i-1],j=i-(i&(-i)),c[i]=a[i]-a[j];
while(m--) {
F>>x>>y;
if(x==2) {
for(t=s,z=-1,i=0;t&&z==-1;t>>=1)
if(i+t<=n) {
if(c[i+t]<y)
i+=t,y-=c[i];
else if(c[i+t]==y)
z=i+t;
}
G<<z<<"\n";
} else {
F>>z;
if(!x)
for(;y<=n;c[y]+=z,y+=(y&(-y)));
else {
for(j=t=0;z;j+=c[z],z-=(z&(-z)));
for(--y;y;t+=c[y],y-=(y&(-y)));
G<<(j-t)<<"\n";
}
}
}
return 0;
}