找到最长的非负子数组

I'm looking for an more efficient alternative to brute force for finding the longest sub array of an array with a non-negative sum. The numbers range from -5 to 5 in this array.I'm looking for an more efficient alternative t