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

22 votes114 views4 answers
Height of the tree
C++
1 vote301 views1 answer
BAPS
C++
-1 vote114 views1 answer
#include
C++
0 vote114 views1 answer
Remove a element from an array c++
C++
2 votes138 views1 answer
MPI_file_open
C++
0 vote127 views1 answer
Ue4 int to enum c++
C++
0 vote121 views1 answer
Use of strtok
C++
0 vote114 views7 answers
Online converter c++ to c
C++
0 vote137 views1 answer
Hpp files
C++
1 vote127 views2 answers
What is c++
C++