Cod sursa(job #3140891)
Utilizator | Data | 10 iulie 2023 15:13:00 | |
---|---|---|---|
Problema | Arbori indexati binar | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.66 kb |
#include<fstream>
using namespace std;
ifstream F("aib.in");
ofstream G("aib.out");
int i,n,a[100001],c[100001],m,j,l,k,s,t,r;
int main()
{
for(F>>n>>m,i=1;i<=n;F>>a[i],a[i]+=a[i-1],j=i-(i&-i),c[i]=a[i]-a[j],++i);
for(l=1;l<=n;l<<=1);
for(;m--;)
if(F>>i>>j,!i)
for(F>>k;j<=n;c[j]+=k,j+=(j&-j));
else if(i<2) {
for(F>>k,s=t=0;k>0;s+=c[k],k-=(k&-k));
for(--j;j>0;t+=c[j],j-=(j&-j));
G<<s-t<<'\n';
} else {
for(i=0,r=l;r&&j;)
if(t=i+r,r>>=1,t<=n&&j>=c[t])
i=t,j-=c[t];
G<<i<<'\n';
}
return 0;
}