Hello, can any one please tell how to solve this question
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
8 | ecnerwala | 3494 |
9 | Um_nik | 3396 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 163 |
3 | -is-this-fft- | 162 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | nor | 155 |
7 | adamant | 155 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
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)$$$