Apply divide and conquer strategy and find the sum and length of the maximum subarray in a given set of integers.

For example in $[-2,3,4,-1,-2,1,5,-3],$ the maximum sum is $7$ and the maximum subarray is $[4,-1,-2,1,5]$

Read the number of integers in the given list and the integers. The output should contain the length and maximum sum of the identified subarray and the integers in the subarray.

For example:

Input Result

$8$

$-234-1-215-3$

Length of the subarray: $5$

Maximum sum:$7$

$4-1-215$