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 vote202 views1 answer
Cpp malloc
C++
0 vote200 views1 answer
C++ how to inherit from a template class
C++
0 vote190 views1 answer
Cpp class access array member by different name
C++
1 vote185 views1 answer
Rapidjson write stringbuffer to file
C++
0 vote228 views1 answer
Convert unsigned long to string c++
C++
1 vote187 views1 answer
Kwakiutl tribe artifacts
C++
0 vote187 views1 answer
Balanced brackets in c++
C++
1 vote190 views2 answers
C++ cast to type of variable
C++
0 vote186 views1 answer
How to put string in array c++
C++
0 vote190 views1 answer
Printing in column c++
C++