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 vote229 views1 answer
Fast input and output c++
C++
1 vote154 views1 answer
Union cpp
C++
213 votes407 views2 answers
C++ switch
C++
0 vote143 views1 answer
Write C++ program to sort an array in ascending order
C++
0 vote148 views1 answer
Mid of linked list
C++
2 votes177 views1 answer
String to wstring
C++
0 vote147 views2 answers
QVariant to int
C++
17 votes145 views6 answers
C vs c++
C++
0 vote157 views1 answer
Memset array bool
C++
0 vote199 views1 answer
UENUM ue4
C++