Binpow in 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 vote211 views2 answers
Tu hi hai aashiqui song lyrics
C++
1 vote184 views1 answer
Ray sphere intersection equation
C++
1 vote242 views3 answers
Minimum characters to make string palindrome
C++
0 vote192 views1 answer
Tan ^-1 ti 83
C++
0 vote190 views1 answer
Macro c++
C++
0 vote189 views1 answer
Input time from console C++
C++
0 vote178 views1 answer
Ask a question and answer it in code c++
C++
0 vote259 views1 answer
Vector of strings initialization c++
C++
0 vote189 views1 answer
What is xor_eq c++
C++
35 votes295 views3 answers
How to write hello world in c++
C++