left ALL BETA Can't read the text? Switch theme 1. Alternate Prefix Sums For an array...

Transcribed Image Text:

left ALL BETA Can't read the text? Switch theme 1. Alternate Prefix Sums For an array of integers, arr[n], its prefix sum array, psum[n], is constructed as psum[i] = sum(arr[0]...arr[i]) where 0≤ i<n. The beauty of psum[n] is psum[0]-psum[1] + psum[2]-psum[3] + ... (-1)-1psum[n-1]. Note: (-1)-1psum[n-1] indicates the last element may be added or subtracted, depending on the parity of n-1. If arr can be rearranged arbitrarily, find the maximum possible value of the beauty of psum[n]. Example n=5 arr [3, 4, 5, 1, 11, The optimal arrangement of arris [3, 1, 5, 1, 4]. psum [3, 4, 9, 10, 14]. The beauty of psum is 3-4+9-10 + 14 - 12. Type here to search Hi 54 17 18 19 20 21 22 23 24 25 26 def getMaxBeauty minVal = 0 Test Results 1 sum = 0 for i in rang sum += ar minVal = startVal = 1 1 return startVa Compiled successfully. Your Output (stdout) 1 Expected Output Cust left ALL BETA Can't read the text? Switch theme 1. Alternate Prefix Sums For an array of integers, arr[n], its prefix sum array, psum[n], is constructed as psum[i] = sum(arr[0]...arr[i]) where 0≤ i<n. The beauty of psum[n] is psum[0]-psum[1] + psum[2]-psum[3] + ... (-1)-1psum[n-1]. Note: (-1)-1psum[n-1] indicates the last element may be added or subtracted, depending on the parity of n-1. If arr can be rearranged arbitrarily, find the maximum possible value of the beauty of psum[n]. Example n=5 arr [3, 4, 5, 1, 11, The optimal arrangement of arris [3, 1, 5, 1, 4]. psum [3, 4, 9, 10, 14]. The beauty of psum is 3-4+9-10 + 14 - 12. Type here to search Hi 54 17 18 19 20 21 22 23 24 25 26 def getMaxBeauty minVal = 0 Test Results 1 sum = 0 for i in rang sum += ar minVal = startVal = 1 1 return startVa Compiled successfully. Your Output (stdout) 1 Expected Output Cust

Answer rating: 100% (QA)

It can be proved that considering 0based indexing If the size o... View the full answer