Cod sursa(job #1378415)

Utilizator vlady1997Vlad Bucur vlady1997 Data 6 martie 2015 12:03:46
Problema Arbori indexati binar Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.11 kb
#include <cstdio>
#define zero(x) (x&(-x))
using namespace std;
int a[100001], n;
void update (int p, int val)
{
    for (int i=p; i<=n; i+=zero(i)) a[i]+=val;
}
int query (int p)
{
    int r=0;
    for (int i=p; i>=1; i-=zero(i)) r+=a[i];
    return r;
}
int bs (int x)
{
    int st=1, dr=n, m, r;
    while (st<=dr)
    {
        m=(st+dr)/2;
        r=query(m);
        if (r==x) return m;
        else if (r<x) st=m+1;
        else dr=m-1;
    }
    return -1;
}
int main()
{
    int m, i, z, p, r, x;
    freopen("aib.in","r",stdin);
    freopen("aib.out","w",stdout);
    scanf("%d%d",&n,&m);
    for (i=1; i<=n; i++)
    {
        scanf("%d",&x);
        update(i,x);
    }
    for (i=1; i<=m; i++)
    {
        scanf("%d",&z);
        if (z==0)
        {
            scanf("%d%d",&p,&x);
            update(p,x);
        }
        else if (z==1)
        {
            scanf("%d%d",&p,&r);
            printf("%d\n",query(r)-query(p-1));
        }
        else
        {
            scanf("%d",&x);
            printf("%d\n",bs(x));
        }
    }
    return 0;
}