How do I find the largest consecutive subarray from a n-sized array which contains both +ve and -ve numbers?

Question

I know it can be solved by dynamic programming, but I am a noob to it. So can anyone give me some hints?
*1≤n≤100000

Answer 1

Which one do you mean
The subarray with the most numbers
The largest number away from 0 (+ve or -ve)
The subarray with the largest number

Answer 2

The subarray with the largest sum