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 vote314 views2 answers
C++ string to wstring
C++
0 vote302 views1 answer
Print all even number using for loop c++
C++
0 vote332 views1 answer
Empty 2d array as a member of a class class c++
C++
3 votes316 views2 answers
C++ find string in string
C++
-1 vote287 views1 answer
Assigning a seed on a random number generator in C++
C++
0 vote266 views7 answers
C++ convert to c online
C++
0 vote284 views1 answer
C++ add everything in a vector
C++
0 vote311 views1 answer
Convert vector into array c++
C++
4 votes346 views1 answer
Continue c++
C++
0 vote331 views1 answer
C++ hours minutes seconds
C++