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

1 vote292 views1 answer
Preorder
C++
0 vote235 views1 answer
Sort deque in c++
C++
0 vote299 views1 answer
C++ set comparator
C++
75 votes333 views6 answers
Conda list envs
C++
0 vote274 views1 answer
Get start with c++
C++
0 vote285 views1 answer
PUBG_APIKEY=<your-api-key> npm t
C++
1 vote260 views2 answers
Bool to string arduino
C++
0 vote259 views1 answer
How the theam are store in database
C++
6 votes288 views1 answer
How to initialize array with new in c++
C++
0 vote248 views1 answer
Freeing array in c++
C++