import java.util.*;public class Solution { public long subsequence (int n, int[] array) { // write code here int dpi=0,dp1=0,dp2=0; for(int i=n-1;i>=0;i--){ dpi=Math.max(dp1,array[i]+dp2); dp2=dp1; dp1=dpi; } return dpi; }}