problem in here N is equal to A given an array's length. Your task is to find the maximum partition-array sum that can be achieved after performing the following operation once. Select some sub-array from the array and set all elements in it to 0. find the maximum sum of the sub-array that can be reached.