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 vote95 views2 answers
Css window id
C++
1 vote100 views1 answer
C++ until
C++
0 vote94 views1 answer
Disabling console exit button c++
C++
1 vote131 views1 answer
Login system with c++
C++
2 votes94 views2 answers
Editable div
C++
-2 votes96 views1 answer
C++ press any key
C++
1 vote98 views1 answer
Tarray ue4 c++
C++
3 votes91 views1 answer
How to convert qt string to string
C++
1 vote106 views4 answers
How to use string in c++
C++
4 votes103 views1 answer
Get index of value c++
C++