Tutorial is loading...
Tutorial is loading...
Tutorial is loading...
Tutorial is loading...
Tutorial is loading...
Tutorial is loading...
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
4 | adamant | 160 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
8 | Dominater069 | 154 |
8 | nor | 154 |
Name |
---|
In problem E, first I solved it using segment tree after iterating in two loops but I got TLE.
Then I replaced the segment tree with a liner search and I got ACC. How did that happen?
This is my first submission (31286366) which had TLE. My second submission (31286415) which passed.
F — good demonstration of overkill in using suffix array.
It is most powerful suffix structure, but anyway it needs additional lcp array, prefix sums array, stack...
Suffix automaton is better here, bcs its need only... one array cnt[]!
GL, kids.
Edit: Please ignore!
can someone please explain me E ! I didn't understand how to keep all the three maximum possible at a time. if we want to maximize the first one we can (just give 2 to smallest and rest with 1) but this is not the case here !
please help me !
The first two numbers are fixed, when you do these two loops. You just have to choose the third number maximum possible.
Isn't this problem similar to 1278C - Berry Jam ?