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

13 votes270 views4 answers
How to lock and hide the cursor unity
C++
3 votes257 views1 answer
Initializing 2d vector
C++
1 vote346 views1 answer
How to hide the c++ console
C++
0 vote267 views2 answers
QVariant to int
C++
0 vote217 views1 answer
C++ starting syntaz
C++
1 vote264 views1 answer
C++ concurrency
C++
-1 vote264 views1 answer
Int to hexadecimal in c++
C++
9 votes275 views4 answers
Range based for loop c++
C++
0 vote240 views4 answers
C++ initialize vector of vector with size
C++
3 votes238 views1 answer
Convert refference to pointer c++
C++