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

2 votes137 views1 answer
How to delete a node c++
C++
41 votes144 views6 answers
Print hello world c++
C++
0 vote127 views1 answer
Surf interpolation matlab
C++
1 vote116 views1 answer
C++ until
C++
3 votes108 views1 answer
C++ check if string contains uppercase
C++
1 vote185 views1 answer
Joining two vectors in c++
C++
0 vote107 views1 answer
How to save system function output into a variable in c++
C++
0 vote107 views1 answer
Cout.flush() in c++
C++
0 vote122 views2 answers
Draw rectangle opencv c++
C++
0 vote110 views1 answer
C++ vector quick search
C++