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

19 votes277 views1 answer
C++ files
C++
26 votes279 views2 answers
Remove from vector by value c++
C++
5 votes278 views3 answers
C++ console color
C++
9 votes349 views3 answers
Max function in c++
C++
1 vote277 views3 answers
Auto in cpp
C++
9 votes265 views5 answers
Priority queue c++ min heap
C++
0 vote261 views1 answer
"how we write a program for" time swap" in c plus plus only with string"
C++
2 votes248 views1 answer
Is javascript for websites only
C++
0 vote260 views1 answer
Traversing a map
C++
0 vote296 views1 answer
Functors in c++
C++