is it possible to solve it by a recursive knapsack algorithm ? it take Time limit exceed when i memo it in 2d array , and if it is impossible how can i solve it by 1d subset sum ? thanks in advance :D
№ | Пользователь | Рейтинг |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 173 |
2 | adamant | 164 |
3 | awoo | 161 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 152 |
8 | pajenegod | 146 |
9 | BledDest | 144 |
10 | Um_nik | 143 |
is it possible to solve it by a recursive knapsack algorithm ? it take Time limit exceed when i memo it in 2d array , and if it is impossible how can i solve it by 1d subset sum ? thanks in advance :D
Название |
---|
yes you can solve it by recursive knapsack with 2d array also .. i solve it and get AC here is my code : Uva 11658 — Best Coalitions