Amalgamated Atrichokes: Difference between revisions

From programming_contest
Jump to navigation Jump to search
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,..."
 
imported>Kmk21
No edit summary
 
Line 2: Line 2:


[[Category:finals2015]]
[[Category:finals2015]]
[[Category:ICPC problems]]
[[Category:ICPC Problems]]
[[Category:Algorithm Trivial]]
[[Category:Algorithm Trivial]]
[[Category:Implementation Trivial]]
[[Category:Implementation Trivial]]
[[Category:Brute Force]]
[[Category:Brute Force]]

Latest revision as of 06:15, 24 August 2016

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?