I'd like to solve some related problems.
HORRIBLE (from Spoj) has been solved.
Thank you.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
I'd like to solve some related problems.
HORRIBLE (from Spoj) has been solved.
Thank you.
Hi everyone!
A while ago I've decided to learn Aho-Corasick algorithm and found the following problem at spoj.com:
I've implemented Aho-Corasick algo and received CRASH. I think, it's a normal situation for such input size.
Now I'd like to know, is this problem solvable using Aho-Corasick or only suffix tree fits in given constraints?
Thanks.
Sup, guys!
Let's consider the following problem: we have a set of strings (initially empty) and must handle two types of queries:
That's all. Of course, time/memory consuming should be as low as possible. Now I don't have an idea better than "Okay, let's use Aho-Corasick algo and each time, when we face query 1, let's destroy our old automaton and create a new one from scratch".
Thanks for your help.
You are given a string (|S| <= 10^5) and have to find such substring that repeats one after another maximum number of times. Or, if there are some such substrings, you must choose the longest/shortest/lexicografically_something.
For example: for test bacacacb
answer is ac
.
How to solve it? Thanks!
Hi, guys!
Today I tried to learn Graham Scan algorithm, but failed :(
Can you help me to find a bug in this code, please? http://ideone.com/IXFfS9 Algorithm is simple, but I still can't understand, why I have WA4 in problem A here http://codeforces.net/gym/100173
Can't even to find a test that can crash my solution :(
Thanks a lot!
May somebody recommend some? Thanks.
Name |
---|