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 vote283 views1 answer
For_each c++
C++
0 vote235 views1 answer
C++ add everything in a vector
C++
0 vote255 views1 answer
Ue_log example
C++
0 vote292 views1 answer
C++ start process and get output
C++
0 vote249 views1 answer
Reverse string upper to lower
C++
0 vote241 views1 answer
Ifstream file (“code2.txt”); dev C++
C++
0 vote245 views1 answer
Sfml disable message
C++
2 votes235 views2 answers
File open cpp
C++
0 vote261 views1 answer
Bash test empty directory
C++
0 vote255 views1 answer
How to get window size sfml
C++