http://www.spoj.pl/problems/ANARC05H how to approach this?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | adamant | 157 |
6 | awoo | 157 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | djm03178 | 153 |
http://www.spoj.pl/problems/ANARC05H how to approach this?
Название |
---|
As string length is not large enough and stated in comments, normal recursion solution passes, you can try every possibility(just make sure whenever you find any invalid string, quit trying it at that time only).
For any string character try two possibility : 1. To include it in current group only. 2. Start a new group with it.(Do this only, when current_group_sum is >= last_group_sum, otherwise this will produce an invalid string).