Cod sursa(job #1183112)

Utilizator badea_adi1999Badea Adrian Catalin badea_adi1999 Data 8 mai 2014 15:25:08
Problema Arbori indexati binar Scor 70
Compilator cpp Status done
Runda Arhiva educationala Marime 1.36 kb
#include <cstdio>
#define ub(x) (x&(-x))
using namespace std;
FILE *f=fopen("aib.in","r");
FILE *g=fopen("aib.out","w");
int n,m;
int aib[100001];
int v[100001];

void add(int a,int val)
{int i;
for (i=a;i<=n;i+=ub(i)) aib[i]+=val;
}
int sum(int a)
{int i,s=0;
for (i=a;i>=1;i-=ub(i)) s+=aib[i];
return s;

}


int main()
{int a,b,i,j,k,st,dr,mijl,s;
fscanf(f,"%d %d",&n,&m);
for (i=1;i<=n;i++) {fscanf(f,"%d",&v[i]);
                    for (j=i-ub(i)+1;j<=i;j++) aib[i]+=v[j];}

while (m!=0) {fscanf(f,"%d",&k);
              if (k==0) {fscanf(f,"%d %d",&a,&b);
                         v[a]+=b;
                         add(a,b);}
              if (k==1) {fscanf(f,"%d %d",&a,&b);
                         fprintf(g,"%d\n",sum(b)-sum(a-1));}
              if (k==2) {fscanf(f,"%d",&a);
                         st=1;dr=n;
                         while (st<=dr) {mijl=(st+dr)>>1;
                                         s=sum(mijl);
                                         if (s==a) {fprintf(g,"%d\n",mijl);break;}
                                               else if (s<a) st=mijl+1;
                                                        else dr=mijl-1;
                                         }
                         if (s!=a) fprintf(g,"-1\n");
                         }
              m--;
              }






return 0;}