- 题目提供者 FarmerJohn2
- 评测方式 云端评测
- 标签 动态规划,动规,dp USACO 2011
- 难度 普及-
- 时空限制 1000ms / 128MB
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.
The maximum sum is obtained by taking the sum from the second through the sixth number (4, 9, -2, -5, 8) => 14.