class Solution {
public int maximumSum(int[] arr) {
int deleted = arr[0];
int contiguous = arr[0];
int result = arr[0];
for (int i = 1; i < arr.length ; i++){
deleted = Math.max(deleted + arr[i], contiguous);
contiguous = Math.max(contiguous + arr[i] , arr[i]);
result = Math.max(result , Math.max(deleted , contiguous));
}
return result;
}
}