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 vote120 views1 answer
Vector of int to string c++
C++
0 vote130 views2 answers
Basic Makefile C++
C++
2 votes134 views1 answer
How to speed up cin and cout
C++
0 vote137 views1 answer
Pretty Print c++ chegg
C++
0 vote139 views1 answer
Binary add using strings
C++
3 votes129 views1 answer
Function in struct c++
C++
6 votes139 views2 answers
C++ create thread
C++
0 vote133 views1 answer
Error uploading arduino code
C++
39 votes161 views6 answers
How to Add to an Array
C++
17 votes118 views1 answer
Input a string in c++
C++