Binpow in fenwick tree

// возвращает индекс, на котором сумма уже больше
int lower_bound (int s) {
    int k = 0;
    for (int l = logn; l >= 0; l--) {
        if (k + (1<<l) <= n && t[k + (1<<l)] < s) {
            k += (1<<l);
            s -= t[k];
        }
    }
    return k;
}

Source: ru.algorithmica.org

Similar codes

7 votes171 views5 answers
Set precision in c++
C++
23 votes155 views2 answers
What is c++ function
C++
0 vote174 views1 answer
How initilaize deffult value to c++ class
C++
0 vote238 views1 answer
Deletion in bst
C++
0 vote160 views1 answer
How to grab each character from a string
C++
0 vote191 views1 answer
How to remove maximum number of characters in c++ cin,ignore
C++
6 votes157 views1 answer
To_string c++
C++
18 votes174 views5 answers
C++ random number
C++
0 vote163 views1 answer
C++ pointer to base class
C++
9 votes164 views3 answers
How to iterate in string in c++
C++