Cod sursa(job #1530127)

Utilizator robx12lnLinca Robert robx12ln Data 21 noiembrie 2015 11:52:42
Problema Arbori indexati binar Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.14 kb
#include<fstream>
using namespace std;
ifstream fin("aib.in");
ofstream fout("aib.out");
int v[100005],n;
void update( int p , int x){
    for( ; p <= n ; p += ( p & -p ) ){
        v[p] += x;
    }
}
int query( int p ){
    int s = 0;
    for( ; p >= 1 ; p -= ( p & -p ) ){
        s += v[p];
    }
    return s;
}
int m,x,op,a,b;
int main(){
    fin>> n >> m;
    for( int i = 1; i <= n; i++ ){
        fin>>x;
        update( i , x );
    }
    for( ; m != 0; m-- ){
        fin>> op;
        if( op == 0 ){
            fin >> a >> b;
            update( a , b );
        }
        if( op == 1 ){
            fin >> a >> b;
            fout<< query( b ) - query( a - 1) << "\n";
        }
        if( op == 2 ){
            fin >> x;
            int st  = 1;
            int dr  = n;
            while( st <= dr ){
                int mid = ( dr + st ) / 2;
                int val = query( mid );
                if( val < x ){
                    st =  mid + 1;
                }else{
                    dr = mid - 1;
                }
            }
            fout << st << "\n";
        }
    }
    return 0;
}