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

1 vote188 views1 answer
Unique ptr c++
C++
0 vote144 views1 answer
Std::vector to array
C++
0 vote152 views1 answer
Sort deque in c++
C++
1 vote142 views2 answers
Enum name ue4 cpp
C++
0 vote226 views1 answer
Vs Code cpp not run
C++
0 vote201 views1 answer
How to store array of string with spaces in c++ stl
C++
0 vote274 views1 answer
Solve diamond inheritance c++
C++
0 vote209 views2 answers
Method
C++
0 vote225 views1 answer
Dijkstra algorithm in c++ geeksforgeeks
C++
4 votes249 views1 answer
Continue c++
C++