Hello... can somebody give me a hint to this problem? I have a O(n^2) solution using dynammic programming that requires O(n) memory, but I still get time limit exceeded... I suspect a greedy solution might work (?)