I am referring to this problem: Determining DNA Health. The editorial mentions using Aho- Corasick Algorithm. I was wondering can it be solved using tries?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3885 |
3 | jqdai0815 | 3682 |
4 | Benq | 3580 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3506 |
7 | ecnerwala | 3505 |
8 | Radewoosh | 3457 |
9 | Kevin114514 | 3377 |
10 | gamegame | 3374 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 170 |
2 | Um_nik | 162 |
3 | atcoder_official | 161 |
4 | maomao90 | 158 |
4 | -is-this-fft- | 158 |
6 | djm03178 | 157 |
7 | Dominater069 | 156 |
8 | adamant | 154 |
9 | luogu_official | 153 |
10 | awoo | 152 |
I am referring to this problem: Determining DNA Health. The editorial mentions using Aho- Corasick Algorithm. I was wondering can it be solved using tries?
Название |
---|
I am the setter of this problem. The Aho-Corasick automaton I mention in the editorial is a trie itself (it is created by adding the suffix links to trie nodes). So, in a way, that problem is solved using tries only.
Hi! Thanks for the reply. I couldn't quite get the editorial because I am new to this data structure. Can you direct me to some good resources which I should refer to so that I can understand the editorial? Thanks for your efforts.
I learnt from here.
http://mirror.codeforces.com/blog/entry/14854
Thanks a lot. :)