excepted_sum = n*(n+1)/2

answer = n*(n+1)/2 — sum(Array)

For c++ users use long long, and for java users use long to avoid overflow

What is the maximum sum we can obtain if we have even number of negative integers?

What about odd number of negative integers?

What is the maximum number of negative integers we may have in an optimal sequence?