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 votes144 views1 answer
Deque c++
C++
0 vote155 views1 answer
Unordered_map header file c++
C++
-1 vote151 views3 answers
Convert c code to c++
C++
0 vote137 views1 answer
MPI_PUT
C++
4 votes138 views1 answer
Convert all characters in string to uppercase c++
C++
1 vote192 views1 answer
Kwakiutl tribe artifacts
C++
2 votes148 views1 answer
Size of stack in c++
C++
0 vote145 views1 answer
Phi function
C++
0 vote144 views1 answer
Unreal engine delay c++
C++
19 votes171 views1 answer
How to do file handling in c++
C++