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 vote239 views1 answer
Vector c++ length integer
C++
0 vote172 views1 answer
Convert c code to java online free
C++
10 votes164 views3 answers
Remove last character from string c++
C++
7 votes171 views3 answers
Setprecision in c++
C++
5 votes160 views1 answer
All library in c++
C++
326 votes416 views3 answers
How to remove to an Array
C++
0 vote156 views1 answer
Platform io change baud rate
C++
0 vote179 views1 answer
Ubuntu dotnet create blazorserver linux
C++
0 vote160 views1 answer
C++ thread incide class
C++
0 vote149 views1 answer
Remove a element from an array c++
C++