+ 1
How do I find the largest consecutive subarray from a n-sized array which contains both +ve and -ve numbers?
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
2 Réponses
0
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
0
The subarray with the largest sum