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 vote104 views1 answer
Find largest number in each row in array c++ using function
C++
1 vote97 views1 answer
Map in c
C++
0 vote92 views1 answer
Qt asynchronous HTTP request
C++
0 vote92 views1 answer
C++ pass ofstream as argument
C++
0 vote95 views2 answers
How to compile with libstdc++ fedora
C++
9 votes97 views2 answers
Delete last char of string C++
C++
0 vote93 views1 answer
Getline of file C++
C++
0 vote93 views1 answer
Compile c++ program
C++
0 vote97 views1 answer
Strong number in c++
C++
70 votes150 views5 answers
Erase element from vector c++
C++