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 vote310 views1 answer
Memcpy c++ usage
C++
1 vote372 views1 answer
Cout char32_t c++
C++
0 vote353 views2 answers
344. Reverse String c++
C++
0 vote318 views1 answer
C++ to assembly
C++
1 vote377 views1 answer
Cpp vector structure
C++
1 vote297 views2 answers
To kill
C++
1 vote347 views1 answer
Isalpha c++
C++
0 vote359 views1 answer
Post order from preorder and inorder calculator
C++
0 vote356 views1 answer
How to complie c++ to spesific name using terminal
C++
2 votes333 views1 answer
How to make a comment in c++
C++