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 vote358 views1 answer
Vector keyword in c++
C++
0 vote350 views1 answer
Statements
C++
1 vote354 views1 answer
Area of a Circle in C++ Programming
C++
0 vote320 views1 answer
Definition of singly linkedlist
C++
0 vote339 views1 answer
Mkdir boost filesystem
C++
0 vote364 views1 answer
How to downgrade numpy
C++
5 votes317 views1 answer
Best clips recording software for cs go
C++
0 vote350 views1 answer
Run c++ program mac
C++
5 votes319 views4 answers
C++ remove whitespace from string
C++
2 votes295 views1 answer
Binary search return index c++
C++