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 votes178 views3 answers
Get first element of set c++
C++
1 vote177 views1 answer
How to modify set C++
C++
1 vote172 views1 answer
Iterate vector from end to begin
C++
1 vote157 views1 answer
Differency between c++ std and stl
C++
0 vote162 views1 answer
Landscape overleaf
C++
0 vote160 views1 answer
Break input stream into words
C++
11 votes157 views1 answer
Inserting at start in vector c++
C++
0 vote167 views1 answer
Mid of linked list
C++
0 vote164 views1 answer
How to make calculaor in c++
C++
4 votes180 views2 answers
Jupyter lab use conda environment
C++