题面修复
查看原帖
题面修复
737873
yingxi楼主2024/10/20 15:33

题面

[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 N(1<=N<=100,000)N (1 <= N <= 100,000) days, and every day i the cows recorded their net profit Pi(1,000<=P_i<=1,000)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.

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

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

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

输入格式

* Line 11 : AA single integer: NN

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

输出格式

* Line 11 : AA 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)(4, 9, -2, -5, 8) => 1414.

感谢@smartzzh 提供的翻译。

2024/10/20 15:33
加载中...