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 vote316 views1 answer
Recherche recursive le max dans une liste
C++
3 votes323 views3 answers
Map in cpp
C++
4 votes363 views2 answers
Float to int c++
C++
6 votes320 views1 answer
To_string c++
C++
0 vote334 views2 answers
C++ typeid
C++
0 vote320 views1 answer
Find the biggest element in the array
C++
0 vote319 views1 answer
Enter the value of integer n. Print the figure as shown below.(3) Sample input 5 Sample output ***** **** *** ** *
C++
0 vote344 views1 answer
How to find the left most bit 1 in binary of any number
C++
0 vote330 views1 answer
How To Calculate 1+1 in c++
C++
0 vote327 views1 answer
Get elements of 2d array c++
C++