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 vote181 views1 answer
Qt asynchronous HTTP request
C++
0 vote189 views1 answer
Https://www.google
C++
0 vote183 views1 answer
Cpp how to add collisions to boxes
C++
0 vote174 views1 answer
1 TO HUNDRED RANDOM NUMBER CPP
C++
0 vote181 views1 answer
Ue4 set size of widget c++
C++
0 vote182 views1 answer
How to display score using SDL in c++
C++
0 vote223 views1 answer
How to analyse a poem
C++
4 votes176 views6 answers
C++ length of char array
C++
8 votes181 views2 answers
C++ factorial
C++
0 vote175 views1 answer
Min element in stl c++
C++