You are given an unsorted array of integers which may contain negative numbers. Example: [2, -3, 0, 5, -2, -5, -1] Devis

[answerhappygod]

You are given an unsorted array of integers which may contain
negative numbers. Example: [2, -3, 0, 5, -2, -5, -1] Devise a
divide and conquer algorithm that finds the largest sequential
subsequence in the array. The largest subsequence in the above
example is bold. For clarification, the algorithm should find the
largest subsequence in the set of both increasing and decreasing
subsequences. Please provide answer using Python.