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 vote142 views1 answer
10011101
C++
5 votes133 views1 answer
How to find 2d vector length cpp
C++
0 vote130 views1 answer
Factorial using recursion cpp
C++
0 vote142 views1 answer
Convert characters to lowercase c++
C++
1 vote121 views1 answer
What is __asm in C++
C++
3 votes138 views1 answer
Initialize dynamic array c++ to 0
C++
0 vote136 views1 answer
Sort function from bigest to smallest c++
C++
0 vote134 views1 answer
Appending string in c++
C++
0 vote130 views1 answer
<< in c++
C++
0 vote157 views1 answer
Run c++ program mac
C++