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

0 vote292 views1 answer
How to use custom array in c++
C++
0 vote270 views1 answer
Give an algorithm for finding the ith-to-last node in a singly linked list in which the last node is indicated by a null next reference.
C++
0 vote276 views1 answer
Sizeof’ on array function parameter ‘arr’ will return size of ‘int*’ [-Wsizeof-array-argument]
C++
0 vote249 views7 answers
C code to mips assembly converter online
C++
0 vote238 views1 answer
Qt make widget ignore mouse events
C++
0 vote302 views1 answer
How to pass std::array with unknown size to function C++
C++
0 vote261 views1 answer
Map float
C++
0 vote275 views1 answer
Three-way comparison c++
C++
3 votes241 views1 answer
Delete one specific character in string C++
C++
1 vote270 views1 answer
C++ read file to char buffer
C++