I am working on a POI problem: http://main.edu.pl/en/archive/oi/14/zap. I have an solution, but I would like to know whether there is an O(n·log(n) + a·log(a)) solution.
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
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 | 173 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 160 |
5 | nor | 157 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
8 | orz | 146 |
10 | pajenegod | 145 |
I am working on a POI problem: http://main.edu.pl/en/archive/oi/14/zap. I have an solution, but I would like to know whether there is an O(n·log(n) + a·log(a)) solution.
I am trying to implement Aho-Corasick on this problem in SPOJ: http://www.spoj.com/problems/SUB_PROB/
I am getting Wrong Answer with my code, but can't seem to figure out why. Here is a link to my code http://ideone.com/NUr1CX. Could someone help me out?
Name |
---|