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 vote296 views1 answer
Compile c++ MPI Program
C++
0 vote290 views1 answer
How to install opencv c++ on windows vscode
C++
9 votes293 views4 answers
Print vector of vector c++
C++
0 vote308 views1 answer
Vector of strings initialization c++
C++
-1 vote319 views1 answer
How to pass arrays by reference c++
C++
0 vote302 views1 answer
SPEED c++
C++
2 votes307 views1 answer
Built in function in c++ for binary to decimal
C++
0 vote272 views1 answer
Delay without blocking
C++
6 votes284 views3 answers
Sstream c++
C++
3 votes272 views1 answer
Convert refference to pointer c++
C++