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 vote378 views1 answer
How to use custom array in c++
C++
0 vote366 views1 answer
SDL_BlitSurface
C++
0 vote298 views1 answer
Electricity billing system project in c++
C++
0 vote325 views1 answer
What type is this c++
C++
0 vote338 views1 answer
Linq select where string equals "String"
C++
0 vote343 views1 answer
How to add external library in clion
C++
0 vote343 views1 answer
Arduino falling edge
C++
0 vote334 views1 answer
How to make a c++ iostream program restart when finished
C++
5 votes370 views3 answers
C++ console color
C++
0 vote424 views3 answers
How to use printf with microseconds c++
C++