Feedback | | If you notice incorrect translations in Contester, please let author know.
|
|
Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.
Difficulty Alpha
Given an array of n
integers, your task is to find the maximum sum of values in a contiguous, nonempty subarray.
Input
The first input line has an integer n
: the size of the array.
The second line has n
integers x1,x2,…,xn
: the array values.
Output
Print one integer: the maximum subarray sum.
Constraints
Example
Input:
8
-1 3 -2 5 3 -5 2 2
Output:
9
Для отправки решений необходимо выполнить вход.
|