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

2 votes312 views1 answer
Clrscr in cpp
C++
0 vote319 views2 answers
C++ server service ros
C++
3 votes297 views1 answer
Max three values c++
C++
4 votes337 views3 answers
Std vector random shuffle
C++
0 vote293 views1 answer
Flowchart to display factors of a number
C++
0 vote296 views10 answers
Convert c program to c++ online
C++
0 vote344 views1 answer
Convert string to wide string
C++
0 vote305 views1 answer
Remove the jth object from the subset
C++
0 vote391 views1 answer
Return array of string in function c++
C++
0 vote305 views1 answer
Apply pca to dataframe
C++