given an array on length $$$n$$$, you have to answer $$$m$$$ queries:
- decrease $$$x$$$ by the numbers greater than $$$x$$$ in the interval $$$[l, r]$$$
- count the occurrence of $$$x$$$ in the interval $$$[l, r]$$$
i have no progress so far.
how to approach this problem
given an array on 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) |