For this Question: The coolness of the subarray of an array is the sum of elements in the subarray. The coolest subarray is the subarray having the maximum coolness, while the hottest subarray is the one having minimum coolness (obviously it can be negative). The coolest and the hottest subarrays are always <b>non-empty</b>.

Tono believes that cool and hot are happy together. The happiness of the array is the absolute difference between the coolness of its coolest and its hottest subarray. 

Given an array A consisting of N elements, find its happiness.The first line of the input contains an integer N.
The next line contains N singly spaced integers A[1], A[2],...A[N]

Constraints
1 <= N <= 200000
-1000000000 <= A[i] <= 1000000000Output a single integer, the happiness of the array.
(The output may not fit into 32 bit integer datatype, use long long integer datatype instead).Sample Input
5
-1 2 -3 1 -5

Sample Output
9

Explanation: Coolest subarray of the array is [2], while the hottest subarray of the array is [-3, 1, -5]. The happiness of the array is 2-(-7)=9., I have written this Solution Code: l = int(input())
arr = list(map(int,input().split()))
maxSum = arr[0]
currSum =0 

maxSumB = arr[0]
currSumB = 0
for j in range(0,l):
    currSum = currSum + arr[j]
    if(maxSum>currSum):
        maxSum = currSum
    if(currSum>0):
        currSum = 0

    currSumB = currSumB + arr[j]
    if(maxSumB<currSumB):
        maxSumB = currSumB
    if(currSumB<0):
        currSumB = 0
print(abs(maxSumB-maxSum)), In this Programming Language: Python, Now tell me if this Code is compilable or not?