| # | User | Rating |
|---|---|---|
| 1 | tourist | 3757 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | awoo | 165 |
| 3 | adamant | 164 |
| 4 | TheScrasse | 159 |
| 5 | nor | 155 |
| 5 | maroonrk | 155 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
A Query Problem
Given an array A consist of N integers. (N <= 10^5). There are Q (Q <= 10^5) queries of two types:
1 x y: Increase x smallest elements, each by 1 which satisfy the following condition: all elements greater than or equal to y. (1 <= x <= N, 0 <= y <= 10^9).
2 l r: Count the number of elements in array A have value in range [l..r]. (1 <= l <= r <= 10^9).
I haven't found an approach to process queries type 1 yet. Could someone help me? Thanks.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en3 |
|
EternalFire | 2018-09-24 17:18:53 | 5 | Tiny change: 's greater or equal ' -> 's greater than or equal ' | |
| en2 |
|
EternalFire | 2018-09-24 17:03:54 | 11 | Tiny change: 't elements which sat' -> 't elements, each by 1 which sat' | |
| en1 |
|
EternalFire | 2018-09-24 17:03:07 | 456 | Initial revision (published) |
