Hi, everyone.
Can someone, please, explain the solution for this problem ?
I really cannot understand what editorial wants to say.№ | Пользователь | Рейтинг |
---|---|---|
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 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
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 |
Hi, everyone.
Can someone, please, explain the solution for this problem ?
I really cannot understand what editorial wants to say.Название |
---|
Автокомментарий: текст был обновлен пользователем TigranHakobyan (предыдущая версия, новая версия, сравнить).
Auto comment: topic has been translated by TigranHakobyan(original revision, translated revision, compare)
Sorry that I can't find editorial. I think you can sort all cars alphabetically and use DP to find maximum length. You have to sort cars to find first-alphabetical one easily.
If you mean just sort a alphabetically, then if we consider {acbd, abcd, bda}. Using your idea we will get answer 2 but the answer is 3, isn't it ?
P.S. editorial
Probelm says, "The front end is the end with the letter that comes first in the alphabet", so you have to flip car "bda" into "adb".
so in case {"acbd", "abcd", "bda"}, the answer is 1.
and if the car A and car B can be linked, A.front <= A.back == B.front <= B.back, so sort like this.
ardiankp's code
sorry about my English — I'm not good at it.
Thank you, so much. I misunderstood the problem.