Hello, can any one please tell how to solve this question
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 163 |
2 | adamant | 161 |
3 | maomao90 | 159 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
6 | nor | 149 |
7 | atcoder_official | 147 |
7 | SecondThread | 147 |
9 | TheScrasse | 146 |
10 | Petr | 144 |
Hello, can any one please tell how to solve this question
Name |
---|
Basically the problem is, given array $$$A$$$ of length $$$n$$$, queries of the form
find $$$x$$$ : find leftmost index with $$$A_i >= x$$$
upd $$$i$$$ $$$y$$$ : increase $$$A_i$$$ by $$$y$$$
So we need to use a segment tree to maintain RMQ of $$$A$$$. Updates are standard. When a query comes, we first check for maximum in the interval $$$[1,n]$$$. If it's $$$< x$$$ then the ans is $$$0$$$. Otherwise check if max in $$$[1,n/2] >= x$$$. In that case we move left, otherwise we go right and query.
Complexity : $$$O(n lg n)$$$