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

38 votes139 views6 answers
How to print hello world in c++
C++
2 votes104 views1 answer
Fatal error: opencv2/opencv.hpp: No such file or directory
C++
18 votes106 views5 answers
C++ clear console
C++
0 vote106 views1 answer
Xor in c++
C++
1 vote108 views1 answer
Qt label set text color
C++
2 votes100 views2 answers
C++ check palindrome
C++
0 vote94 views2 answers
Create a file
C++
0 vote116 views1 answer
BMI Calculator Program in C++
C++
0 vote95 views7 answers
C++ convert to assembly language
C++
0 vote105 views1 answer
Cmake g++ address sanitizer
C++