| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3831 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | gamegame | 3386 |
| 10 | ksun48 | 3373 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | -is-this-fft- | 158 |
| 6 | awoo | 157 |
| 7 | adamant | 156 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | Dominater069 | 153 |
Data structures problem
I was solving a segment tree problem in witch you are given:
Update L, R. — updates [L;R] with the value of the current operation (1, 2, ... M)
Query. — count different elements in [0; N]
N <= 10^7
M <= 4 * 10^4
I couldn't come with an aproach. I will be really happy if someone helps me with it. Thankd in advance! :)
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en4 |
|
protypuns | 2015-10-23 17:40:47 | 12 | ||
| en3 |
|
protypuns | 2015-10-23 17:40:08 | 32 | Tiny change: 'ments in [N; M]\n\nI coul' -> 'ments in [0; N]\n\nN <= 10^7\nM <= 4 * 10^4\n\nI coul' | |
| en2 |
|
protypuns | 2015-10-23 17:38:48 | 4 | ||
| en1 |
|
protypuns | 2015-10-23 17:38:22 | 344 | Initial revision (published) |
