#4737. [USACO11JAN] Profits S

[USACO11JAN] Profits S

题目描述

The cows have opened a new business, and Farmer John wants to see how well they are doing. The business has been running for NN (1<=N<=100,0001 <= N <= 100,000) days, and every day ii the cows recorded their net profit PiP_i (1,000<=Pi<=1,000-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.

奶牛们开始了新的生意,它们的主人约翰想知道它们到底能做得多好。这笔生意已经做了 $N(1N100,0001≤N≤100,000)天,每天奶牛们都会记录下这一天的利润PiP_i1000Pi1000-1000≤P_i≤1000)。

约翰想要找到奶牛们在连续的时间期间所获得的最大的总利润。(注:连续时间的周期长度范围从第一天到第 NN 天)。

请你写一个计算最大利润的程序来帮助他。

输入格式

Line 1: A single integer: NN

Lines 2..N+1: Line i+1 contains a single integer: PiP_i

输出格式

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

输入输出样例 #1

输入 #1

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

输出 #1

14

说明/提示

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