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 vote116 views1 answer
Overload of << c++
C++
0 vote122 views1 answer
C++ do you not inherit constructor
C++
99 votes272 views6 answers
How to convert int to string c++
C++
0 vote120 views1 answer
Gfgdf
C++
0 vote116 views1 answer
Size of a matrix c++
C++
1 vote127 views1 answer
Create n threads cpp
C++
4 votes130 views4 answers
Pointer
C++
0 vote139 views1 answer
And c++
C++
0 vote137 views1 answer
C++ getline doesn't wait for input
C++
0 vote135 views1 answer
Cpp loop through object
C++