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

2 votes308 views1 answer
Pbds in c++
C++
1 vote315 views1 answer
Class Solution { public: vector<vector<int>> threeSum(vector<int>& nums) meaning
C++
2 votes280 views3 answers
Online ide c++
C++
0 vote317 views1 answer
Free a pointer c++
C++
1 vote239 views3 answers
C++ split string on newline
C++
0 vote281 views1 answer
Static_cast c++
C++
0 vote277 views1 answer
Pros millis()
C++
0 vote302 views1 answer
C++ switch integer
C++
14 votes289 views1 answer
Array 2d dynamic allocation c++
C++
1 vote285 views4 answers
Sum vector c++
C++