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 vote114 views1 answer
C++ double is nan
C++
0 vote111 views1 answer
Initialisation of a c++ variable
C++
0 vote107 views1 answer
How to have a queue as a parameter in c++
C++
1 vote98 views1 answer
Esp32 restart from code
C++
0 vote105 views7 answers
Online converter c++ to c
C++
0 vote102 views1 answer
Getline of file C++
C++
0 vote143 views2 answers
\0 in c++
C++
1 vote110 views2 answers
Cvtcolor rgb to gray
C++
8 votes147 views10 answers
Never gonna give you up
C++
25 votes109 views10 answers
Netflix
C++