Cod sursa(job #999278)

Utilizator RaduGabriel2012Dinu Radu RaduGabriel2012 Data 19 septembrie 2013 19:30:01
Problema Arbori indexati binar Scor 60
Compilator cpp Status done
Runda Arhiva educationala Marime 0.91 kb
#include <iostream>
#include <fstream>
#define zeros(x) ((x^(x-1))&x)
using namespace std;
ifstream f("aib.in");
ofstream g("aib.out");
int n,m,a[100005],s[100005];
void Update(int x,int nr)
{ int i;
   for(i=x;i<=n;i+=zeros(i))
     a[i]+=nr;
}
int Compute(int x)
{ int i,res=0;
   for(i=x;i>=1;i-=zeros(i))
     res+=a[i];
return res;
}
int Search(int x)
{ int i,l=1,r=n,mid,sum;
   while(l<r)
    { mid=(l+r)/2;
       sum=Compute(mid);
       if (x<=sum) r=mid; else l=mid+1;
    }
if (Compute(l)==x) return l;
return -1;
}
int main()
{ int i,t,x,y,el;
  f>>n>>m;
    for(i=1;i<=n;i++)
      {f>>el;
       s[i]=s[i-1]+el;
       a[i]=s[i]-s[i-zeros(i)];
      }


    for(i=1;i<=m;i++)
     { f>>t;
        if (t==0) { f>>x>>y; Update(x,y); }
        if (t==1) { f>>x>>y; g<<Compute(y)-Compute(x-1)<<"\n"; }
        if (t==2) { f>>x; g<<Search(x)<<"\n"; }
     }
    return 0;
}