IN THIS PROBLEM I DON'T UNDERSTAND THE GRAPH APPROACH FOR THIS PROBLEM? CAN ANYBODY HELP OUT!! PROBLEM LINK TUTORIAL LINK
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
IN THIS PROBLEM I DON'T UNDERSTAND THE GRAPH APPROACH FOR THIS PROBLEM? CAN ANYBODY HELP OUT!! PROBLEM LINK TUTORIAL LINK
Название |
---|
Make a graph with vertexes 1, 2, ..., n; for each i a substring sisi + 1...si + k - 1 should be a palindrome, so for each i you should make edges between si and si + k - 1, between si + 1 and si + k - 2, etc. For each connected component in this graph, letters should be equal in each vertex of that component; if number of components is e then the answer is me
thanxx bro appreciate it!!!