The best I came up with is O( N*sqrt(N)*log(N) ) using MO to sort the queries — the log(N) part is for querying the most frequent value in that range. Got TLE with that — even in some smaller cases.
Any hint? :)
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
8 | ecnerwala | 3494 |
9 | Um_nik | 3396 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | -is-this-fft- | 160 |
2 | maomao90 | 160 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
The best I came up with is O( N*sqrt(N)*log(N) ) using MO to sort the queries — the log(N) part is for querying the most frequent value in that range. Got TLE with that — even in some smaller cases.
Any hint? :)
I would be immensely grateful if you could suggest a book I could read from about these. The online materials seem rather scattered.
Some help/hint would be greatly appreciated :)
Hello
I would be immensely grateful if anyone could kindly give me any link to an easy-to-understand Suffix Automaton tutorial. Emaxx is hard for me to understand due to foggy Google translator and all other pdf's I managed to get from the internet seemed kind of complex :(
I understand that something that is complicated for someone may be too easy for someone else. So, I would be more than happy if you just give me the tutorial that You thought was good enough for you :)
Hi
Could any kind person give me any hint to solve this problem? I am horrible at math :(
Finding unique numbers in N*N multiplication table? :(
Hi
If you know Chinese, could you be very kind and translate the part from "1003 Revenge of Nim II" from http://bestcoder.hdu.edu.cn/ ? :) Google translation is really hard to understand for me.
Name |
---|