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 vote309 views1 answer
Update variable in const function C++
C++
0 vote527 views1 answer
Why constructor can't be static in c++
C++
0 vote285 views1 answer
Iterate over 2 vectors c++
C++
1 vote278 views2 answers
Scope resolution operator in c++
C++
1 vote309 views1 answer
Operator precedence in cpp
C++
3 votes285 views1 answer
Initializing 2d vector
C++
2 votes324 views1 answer
What language is ethereum written in
C++
3 votes268 views1 answer
Stl library c++ header
C++
92 votes532 views6 answers
String reverse
C++
0 vote287 views1 answer
Summation of Natural Number Sequence with c and c++.
C++