Time Limit: 1s
Memory Limit: 256MB
skyjiange get a array A consist of n integers, he want to know what is the maximum absolute sum in all sub-arrays, sub-arrays is some array A[i...j], absolute sum is equal to |sum(A[i...j])|.
each line contains a integer n(1<=n<=100000), follow by n integers(|A[i]|<=10000).
print the maximum abs sum.
3 1 -2 5 3 2 -1 5