Timeline for Given $N$ integers on a circle, how to choose them in pairs to obtain minimum sum?
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 7, 2019 at 7:46 | comment | added | user142757 | @GerhardPaseman Maybe from codechef.com/JULY19A/problems/CIRMERGE | |
| Jul 6, 2019 at 21:40 | comment | added | Gerhard Paseman | I believe there is a quartic time algorithm involving dynamic programming along the lines of your suggestion. I am concerned that the original poster is asking us to solve a competition problem for them. Gerhard "Is Waiting For The Uproar" Paseman, 2019.07.06. | |
| Jul 6, 2019 at 20:44 | history | answered | Mehtaab Sawhney | CC BY-SA 4.0 |