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

6 votes334 views1 answer
Convert string to stream c++
C++
0 vote312 views1 answer
Intlen in c++
C++
0 vote351 views1 answer
Functors in c++
C++
0 vote305 views1 answer
C++ do every 1 minutes
C++
0 vote359 views1 answer
Cpp language explained
C++
1 vote312 views2 answers
How to find the size of a character array in c++
C++
1 vote310 views1 answer
Qlabel set text color
C++
0 vote325 views2 answers
C++ server service ros
C++
0 vote319 views1 answer
Closing a ifstream file c++
C++
1 vote323 views1 answer
Cpp std list example
C++