Given a sequence of n positive integers, find the maximum sum of a subsequence such that no two selected elements are adjacent in the original array. (Generalized House Robber for CF context.)