Hi. I was working on a DP problem (SPOJ MFISH) but I couldn't understand how the DP works. I've seen a few codes online but couldn't comprehend them either. Could someone explain it to me?
Hi. I was working on a DP problem (SPOJ MFISH) but I couldn't understand how the DP works. I've seen a few codes online but couldn't comprehend them either. Could someone explain it to me?
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 152 |
| 3 | Proof_by_QED | 146 |
| 3 | Um_nik | 146 |
| 5 | Dominater069 | 144 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
Consider the ships sorted by their anchor index. For every ship you can find a range of indexes where it can start. Just try every possible placement for each ship. The complexity is O(n) because you visit every index at most twice.
P.S.: Thanks to SPOJ, I just found out that there is a programming language called "chicken" :D
OK, got AC. I was using the end location of ships to do my DP, but I think I calculated them wrong. Thanks!