Cod sursa(job #2546428)

Utilizator MoldovanAndrei1Moldovan Andrei MoldovanAndrei1 Data 14 februarie 2020 10:23:50
Problema Arbori indexati binar Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.28 kb
#include <bits/stdc++.h>
using namespace std;
int aib[400005];
int n;
void update(int poz,int a)
{
  for(int i=poz;i<=n;i+=i&-i)
        aib[i]+=a;
}
int query(int poz)
{
    int sum=0;
    for(int i=poz;i>0;i-=i&-i)
        sum+=aib[i];
    return sum;
}
int v[100005];
int main()
{
    freopen("aib.in","r",stdin);
    freopen("aib.out","w",stdout);
    int m,i,j;
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++)
        {
            scanf("%d",&v[i]);
            update(i,v[i]);
        }
        int x,y,z;
    for(i=1;i<=m;i++)
    {
        scanf("%d%d",&x,&y);
        if(x<2)scanf("%d",&z);
        if(x==0)
        {
            update(y,z);
        }
        if(x==1)
        {
            printf("%d\n",query(z)-query(y-1));
        }
        if(x==2)
        {
            int st=1,dr=n;
            int ok=1;
            while(st<=dr)
            {
                int med=(st+dr)/2;
                int sum=query(med);
                if(sum==y)
                {printf("%d\n",med);ok=0;break;}
                if(sum>y)dr=med-1;
                else
                st=med+1;
            }
            if(ok)
            {
                printf("-1\n");
                continue;
            }
        }
    }
    return 0;
}