i need help with "sub array with the largest sum"

[watted]

hi ,I'm new in c++ trying to write function that take "input" array and return "show" the sub-array with the largest sum,
for example:{-2,-2,4,-2,5,-3,4,-5,-4,1}
the result:{4,-2,5,-3,4}

,hope you help me guys.

[Cody0023]

sooo i dont understand exactly what you need to do.

[i like red pandas]

http://en.wikipedia.org/wiki/Maximum_subarray_problem

This link should help.

[watted]

thank you:)))