Hello everyone, can anybody tell me how to find no of distinct elements of a range ?
# | User | Rating |
---|---|---|
1 | jiangly | 3977 |
2 | tourist | 3815 |
3 | jqdai0815 | 3682 |
4 | ksun48 | 3614 |
5 | orzdevinwang | 3526 |
6 | ecnerwala | 3514 |
7 | Benq | 3483 |
8 | hos.lyric | 3381 |
9 | gamegame | 3374 |
10 | heuristica | 3358 |
# | User | Contrib. |
---|---|---|
1 | cry | 170 |
2 | -is-this-fft- | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 160 |
5 | djm03178 | 157 |
6 | Dominater069 | 156 |
7 | adamant | 154 |
8 | luogu_official | 152 |
8 | awoo | 152 |
10 | TheScrasse | 147 |
Hello everyone, can anybody tell me how to find no of distinct elements of a range ?
Name |
---|
You can do it with Mo's algorithm ,
Use Mo's Algorithm in $$$O(n \sqrt{n})$$$ or sweepline fenwick tree in $$$O(n \log n)$$$. There are probably a lot of tutorials on this since it's so classic.
Both require offline tho
why you solved only 4 problems last hello
this blog will help — blog
sweepline range sums best