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 vote228 views1 answer
C++ set value to inf
C++
0 vote207 views1 answer
Person parametr cpp
C++
9 votes260 views2 answers
C++ remove last element from array
C++
0 vote252 views1 answer
How to find total numbe of distinct characters in a string in c
C++
0 vote226 views1 answer
C++ triangle
C++
0 vote260 views1 answer
How to display score using SDL in c++
C++
3 votes239 views4 answers
String c++
C++
0 vote265 views1 answer
Stl
C++
0 vote227 views1 answer
& in xml
C++
0 vote218 views10 answers
Online compiler c++ with big O calculator
C++