Can someone help me solve this problem? Given N <= 16 strings I need to find the shortest(in length) string that contains all N strings as a substring, in case of a tie I need to find the smallest one in lexicographic order. Thanks in advance
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3947 |
2 | jiangly | 3740 |
3 | Radewoosh | 3652 |
4 | Benq | 3626 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3612 |
7 | ecnerwala | 3587 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3485 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 163 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | atcoder_official | 155 |
4 | nor | 155 |
6 | -is-this-fft- | 153 |
6 | cry | 153 |
8 | maroonrk | 152 |
9 | SecondThread | 148 |
10 | Petr | 146 |
Shortest Common Superstring
Can someone help me solve this problem? Given N <= 16 strings I need to find the shortest(in length) string that contains all N strings as a substring, in case of a tie I need to find the smallest one in lexicographic order. Thanks in advance
Название |
---|