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

3 votes163 views1 answer
What language was c+ written in
C++
5 votes139 views2 answers
String c++ if letter is lowercase
C++
0 vote128 views1 answer
Cosnt cast
C++
0 vote187 views1 answer
How to use printf with <cinttypes> c++
C++
0 vote135 views1 answer
Powershell get uptime remote computer
C++
6 votes147 views2 answers
Strcmp
C++
0 vote136 views1 answer
Vector of threads thread pool c++
C++
1 vote128 views1 answer
C++ for loop multiple variables
C++
-1 vote132 views1 answer
Combination sum iv leetcode
C++
0 vote131 views1 answer
Swap of two numbers in c++
C++