Please help me out on this problem.
public static long iplBU(int pay[]){
long prev = pay[0];
long next = pay[0] + pay[1];
for(int i = 2; i<pay.length;i++){
long maxN = 0;
if(next - pay[i-1] == prev){
maxN = prev + pay[i];
}else{
maxN = (long)Math.max(prev, next) + pay[i];
}
prev = (long)Math.max(prev, next);
next = maxN;
}
return (long)Math.max(prev, next);
}