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 vote290 views2 answers
Length of number c++
C++
0 vote308 views1 answer
Dynamic memory in c++
C++
0 vote326 views1 answer
# in c++
C++
0 vote330 views1 answer
Stl
C++
0 vote403 views1 answer
Solve diamond inheritance c++
C++
-2 votes323 views1 answer
Sum array c++
C++
0 vote323 views1 answer
Ue4 get size of viewport c++
C++
3 votes304 views1 answer
Friend function in c++
C++
0 vote318 views1 answer
How to find product of a given numbers in c++
C++
10 votes332 views2 answers
Check if char in string c++
C++