Amalgamated Atrichokes

From programming_contest
Revision as of 06:15, 24 August 2016 by imported>Kmk21 (Created page with "Go day by day and remember the highest price you've seen. If today is a new highest price, remember it. If today has a new greatest difference with the current highest price,...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Go day by day and remember the highest price you've seen. If today is a new highest price, remember it. If today has a new greatest difference with the current highest price, remember it. I can't believe this was actually a world finals problem. I suppose this could be considered a DP....but what can't?

Retrieved from "https://wiki.speedyguy17.info/index.php?title=Amalgamated_Atrichokes&oldid=694"