Given an array all of whose elements are positive numbers, find the maximum sum of a subsequence with the constraint that no 2 numbers in the sequence should be adjacent in the array. So 3 2 7 10 should return 13 (sum of 3 and 10) or 3 2 5 10 7 should return 15 (sum of 3, 5 and 7)

大致想了下用动态规划解，具体代码没写出来。。

哈哈，VRP问题的变体。。。。。。。。。

动态规划是最初级的，遗传，蚁群。。。

比较难。。。。。