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

70 votes277 views5 answers
Erase element from vector c++
C++
19 votes207 views3 answers
File reading c++
C++
1 vote242 views1 answer
C++ milliseconds
C++
0 vote250 views1 answer
How to use printf with <cinttypes> c++
C++
2 votes176 views1 answer
Java print f int
C++
0 vote244 views1 answer
Format string cpp
C++
2 votes234 views1 answer
Pbds in c++
C++
0 vote172 views1 answer
C++ rename function
C++
0 vote184 views1 answer
How to get max grade c++
C++
1 vote167 views1 answer
Get the element at an index list c++
C++