Logo
(追記) (追記ここまで)

5953번 - Profits 다국어

시간 제한메모리 제한제출정답맞힌 사람정답 비율
1 초 128 MB31920116862.687%

문제

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

예제 출력 1

14

힌트

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

출처

Olympiad > USA Computing Olympiad > 2010-2011 Season > USACO January 2011 Contest > Silver 1번

(追記) (追記ここまで)

출처

대학교 대회

  • 사업자 등록 번호: 541-88-00682
  • 대표자명: 최백준
  • 주소: 서울시 서초구 서초대로74길 29 서초파라곤 412호
  • 전화번호: 02-521-0487 (이메일로 연락 주세요)
  • 이메일: contacts@startlink.io
  • 통신판매신고번호: 제 2017-서울서초-2193 호

AltStyle によって変換されたページ (->オリジナル) /