#481 - What Goes Up| Solved By: | wesley | | Theory Difficulty: | easy | | Coding Difficulty: | easy | | Algorithms Used: | dynamic programming
| | Solution Description: | This is a standard LIS problem, but the input is large so you'll need to use the O(n log n) version of the algorithm. |
Copyright 2008 (c) QuestToSolve.Com - Graphs Powered By
|