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 vote172 views1 answer
Bfs sudocode
C++
0 vote147 views1 answer
Get first and last character of string c++
C++
0 vote137 views3 answers
Onoverlapbegin ue4 c++
C++
25 votes136 views6 answers
Fibonacci
C++
0 vote234 views1 answer
Time and date (tm structure ) in C++
C++
0 vote206 views1 answer
Json::iterator c++
C++
-1 vote110 views1 answer
Dynamic 2d array c++
C++
2 votes143 views1 answer
How to write something in power of a number in c++
C++
0 vote146 views1 answer
Vector of vector definaion in c++
C++
18 votes136 views3 answers
How to make a 2d vector in c++
C++