Detail of message

Online Judge

Problem Set

Authors

Online Contests

User

Web Board
Home Page
F.A.Qs
Statistical Charts

Current Contest
Past Contests
Scheduled Contests
Award Contest

Re:树状数组高级应用啊 sumseek函数今天才知道！

Posted by 1110310214 at 2013-07-30 20:29:03 on Problem 2828
In Reply To:树状数组高级应用啊 sumseek函数今天才知道！ Posted by:1110310214 at 2013-07-30 20:28:30

> int sumseek (int k)//寻找部分和为k的第一个位置
> {
>     int ans = 0, sum = 0, i;
>     for (i = 18; i >= 0; i--)
>     {
>         ans += (1 << i);
>         if (ans >= n || sum + bit[ans] >= k) ans -= (1 << i);
>         else sum += bit[ans];
>     }
>     return ans + 1;
> }

Followed by:

Re:树状数组高级应用啊 sumseek函数今天才知道！ (9) 1110310214 2013-07-30 20:29:27
Re:树状数组高级应用啊 sumseek函数今天才知道！ (0) 2018306666 2019-04-21 22:53:15

Post your reply here:

Home Page Go Back To top

Re:树状数组高级应用啊 sumseek函数 今天才知道！

Re:树状数组高级应用啊 sumseek函数今天才知道！