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

7 votes354 views5 answers
Stack c++
C++
10 votes315 views2 answers
C++ convert binary string to decimal
C++
0 vote315 views1 answer
Qt background color
C++
0 vote335 views1 answer
What is c++ file extension
C++
0 vote311 views1 answer
Check if char are equal c++
C++
0 vote315 views1 answer
Compile notepad++ c++
C++
6 votes323 views6 answers
Ue4 log
C++
14 votes326 views1 answer
Array 2d dynamic allocation c++
C++
1 vote351 views1 answer
Qt design editor hide window bottom white bar
C++
1 vote311 views1 answer
Plus (programming language)
C++