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

3 votes216 views3 answers
Get first element of set c++
C++
-1 vote218 views2 answers
How to delete a file in cpp
C++
1 vote248 views1 answer
Can you verify adsense no ssl certificate
C++
1 vote256 views1 answer
Multithreading
C++
0 vote208 views1 answer
Print hola mundo
C++
0 vote198 views1 answer
How to write a conclusion statement for an informative essay
C++
1 vote178 views1 answer
C++ lock
C++
0 vote187 views1 answer
Honeygain linux
C++
0 vote183 views1 answer
Print pattern and space in cpp
C++
0 vote209 views3 answers
Tower of hanoi
C++