The problem is similar to https://leetcode.com/problems/maximum-subarray/ but exactly one difference is we define

sum_new(i, j) = arr[i] - arr[i+1] + arr[i+2] - arr[i+3] ... -+ arr[j]

find i, j for maximum sum_new