Given a sequence of ‘N’ integers. Partition the sequence into two non-empty contiguous sequences such that each element of the original sequence should appear in exactly one of these subsequences and...

Given a sequence of ‘N’ integers. Partition the sequence into two non-empty contiguous sequences such that each element of the original sequence should appear in exactly one of these subsequences and also the product of the sum of elements in the left subsequence and the sum of elements in the right subsequence are maximum as possible. Create threads to implement this problem.
Example: Given the sequence of numbers: [2 8 8 2 32]
Partitioned sequences are: [2 8 8 2] , [32]
Product of the sum of two sequences: [20] * [32] = 640