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

9 votes111 views2 answers
C++ for in
C++
1 vote103 views1 answer
Gestd::getline with wstring
C++
0 vote127 views1 answer
C++ allocate and free dynamic 2d array
C++
3 votes120 views2 answers
Set precision in c++ no decimal places\
C++
0 vote110 views1 answer
Get type of variable in c++
C++
0 vote112 views2 answers
GCD(x, yz)
C++
0 vote115 views1 answer
Reading package lists... Done Building dependency tree Reading state information... Done mysql-server is already the newest version (5.7.36-0ubuntu0.18.04.1). 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.
C++
0 vote97 views1 answer
Define c++
C++
0 vote111 views1 answer
Mingw32/bin/ld.exe: C:\Users\mfrom\AppData\Local\Temp\ccSKcRks.o:PizzaPi.cpp:(.text$_ZN5PizzaC2Ev[__ZN5PizzaC2Ev]+0xa): undefined reference to `vtable for Pizza' collect2.exe: error: ld returned 1 exit status
C++
18 votes104 views3 answers
How to make a 2d vector in c++
C++