Profits
题号:NC24613
时间限制:C/C++/Rust/Pascal 1秒,其他语言2秒
空间限制:C/C++/Rust/Pascal 32 M,其他语言64 M
64bit IO Format: %lld

题目描述

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 (1 <= N <= 100,000) days, and every day i the cows recorded their net profit P_i (-1,000 <= P_i <= 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 N days.) Help him by writing a program to calculate the largest sum of consecutive profits.

输入描述:

* Line 1: A single integer: N
* Lines 2..N+1: Line i+1 contains a single integer: P_i

输出描述:

* Line 1: A single integer representing the value of the maximum sum of profits for any consecutive time period.
示例1

输入

复制
7 
-3 
4 
9 
-2 
-5 
8 
-3 

输出

复制
14

说明

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