Timeline for How to get the highest score in this game?
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 30, 2021 at 6:18 | vote | accept | Rob32409 | ||
| Oct 29, 2021 at 18:02 | answer | added | gnasher729 | timeline score: 4 | |
| Oct 29, 2021 at 17:28 | comment | added | D.W.♦ | cs.stackexchange.com/tags/dynamic-programming/info | |
| Oct 29, 2021 at 17:28 | history | edited | D.W.♦ |
edited tags
|
|
| Oct 29, 2021 at 10:41 | comment | added | Yuval Filmus | My guess at the problem is that you choose one of $A[i],B[i],C[i]$ at each turn, and cannot choose the same array consecutively. You want to maximize the sum of values. This can be solved in linear time using dynamic programming. | |
| Oct 29, 2021 at 9:15 | comment | added | Steven | How is the fact that there are three players relevant? From your description it seems that the choice of a player never interferes with the choices of the other players. | |
| Oct 29, 2021 at 8:55 | comment | added | Rob32409 | @YuvalFilmus: Wouldn't the dynamic programming approach take $O(n^2)$ too? | |
| Oct 29, 2021 at 7:29 | comment | added | Yuval Filmus | Use dynamic programming. | |
| Oct 29, 2021 at 7:07 | history | asked | Rob32409 | CC BY-SA 4.0 |