| # | User | Rating |
|---|---|---|
| 1 | tourist | 3757 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | awoo | 165 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | maroonrk | 155 |
| 6 | nor | 154 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 147 |
| 9 | orz | 145 |
| 10 | pajenegod | 144 |
I'm trying to do MCHEF from codechef long july 2015 . I've tried to implement what is written in the editorial but i'm constantly getting tle , The complexity of my solution seems to be enough to pass the constraints.Why am i getting TLE?? help !!
LINK TO CODE- http://pastebin.com/T5ZxchXL
How can i find the no. of distinct substrings of a string using Z-FUNCTION/Z-ARRAY ?
Time complexity should be less than O(n2).
I know there is a way using suffix array but i am more interested in solving this using Z-array/Z-function.
