given an array $$$a$$$ of length $$$n$$$, you have to answer $$$m$$$ queries:
- decrease the numbers greater than $$$x$$$ by $$$x$$$ in the interval $$$[l,r]$$$
- count the occurrence of $$$x$$$ in the interval $$$[l, r]$$$
i have no progress so far.
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | jiangly | 3670 |
| 3 | Kevin114514 | 3657 |
| 4 | maroonrk | 3355 |
| 5 | Um_nik | 3353 |
| 6 | squareOf105 | 3346 |
| 7 | tourist | 3343 |
| 8 | strapple | 3324 |
| 9 | heuristica | 3322 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 143 |
| 5 | Um_nik | 141 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 133 |
| 8 | maroonrk | 133 |
| 10 | qwexd | 130 |
how to approach this problem
given an array $$$a$$$ of length $$$n$$$, you have to answer $$$m$$$ queries:
i have no progress so far.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en3 |
|
dernier_jour | 2025-03-31 06:11:26 | 15 | ||
| en2 |
|
dernier_jour | 2025-03-31 05:24:20 | 6 | Tiny change: ' an array on length $n' -> ' an array $a$ of length $n' | |
| en1 |
|
dernier_jour | 2025-03-31 05:23:53 | 250 | Initial revision (published) |
| Name |
|---|


