#P3009. [USACO11JAN] Profits S

[USACO11JAN] Profits S

Description

The cows have opened a new business, and Farmer John wants to see how well they are doing. The business has been running for N(1N105)N (1 \leq N \leq 10^5) days, and every day i the cows recorded their net profit Pi(1,000Pi1,000)P_i (-1,000\leq P_i \leq 1,000).

Farmer John wants to find the largest total profit that the cows have made during any consecutive time period. (Note that a consecutive time period can range in length from one day through NN days.) Help him by writing a program to calculate the largest sum of consecutive profits.

Input Format

  • Line 11: A single integer: NN.

  • Lines 2N+12\dots N+1: Line i+1i+1 contains a single integer: PiP_i.

Output Format

  • Line 11: A single integer representing the value of the maximum sum of profits for any consecutive time period.
7 
-3 
4 
9 
-2 
-5 
8 
-3 

14 

Hint

The maximum sum is obtained by taking the sum from the second through the sixth number (4,9,2,5,8)14(4, 9, -2, -5, 8) \geq 14.