```java public int dig (int [] arr){ int len = arr.length; if(len ==0 ) return 0; if(len ==1 ) return arr[0]<0?0:arr[0]; int [] dp0 = new int[len] , dp1= new int[len] ; dp1[0] = arr[0]; for(int i =1 ; i< len; i++){ dp1[i] = dp0[i-1] + arr[i]; dp0[i] = Math.max(dp0[i-1],dp1[i-1]); } return Math.max(dp0[len-1],dp1[len-1]); } ```