Can some one tell me how to solve this problem ?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3821 |
3 | Benq | 3736 |
4 | Radewoosh | 3631 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3388 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Can some one tell me how to solve this problem ?
Name |
---|
We iterate through the number i. Let us learn in O (1) to understand for some of the smallest substring j b [0 ... n - i - 1] can be represented as a [i 1 ... j - 1] r (a [j. .. n - 1]). To do this, calculate the prefix function (p [i]) for the string s1 = r (a) '\ 0' b and the z-function (z [i]) for the string s2 = b '\ 0' a. It is clear that for fixed i, j is the required value will be n - p [2n - i - 1], with the substring a [i 1 ... j - 1] and b [0 .. j - i] must be the same (1). The last statement is easily verified, using the calculated z-function. Is also trivial proof of the fact that if a fixed i the property (1) does not hold for the chosen j, then it will fail for large j.
The asymptotic complexity of the solution - O (n).