Neboderi
레이팅 미적용의견: 0
Domagoj is in the big city of London! Right now, there is a sequence of tall
skyscrapers in front of him and he wants to take a photograph to remember the
moment.
The sequence of skyscrapers can be represented as a sequence of \(n\) numbers
\(h\)1, h2, . . . , h\(n\) where the number \(h@@RISE_MATH_BLOCK_0@@l\) + . . . + \(h\)\(r\)).
Help Domagoj determine the beauty of the most beautiful photograph with at least \(k\) skyscrapers!
Subtask 1 (11 points): n, \(k \le 100\)
Subtask 2 (22 points): n, \(k \le 5000\)
Subtask 3 (27 points): \(h_{i} \le 100\)
Subtask 4 (18 points): n, \(k \le 5 \cdot 10^{4}\)
Subtask 5 (32 points): No additional constraints.
The first line contains two integers \(n\), \(k\) (\(1 \le k \le n \le 10^{6}\)), the number of skyscrapers, and the number \(k\).
The second line contains \(n\) integers \(h_{1}\), h_{2}, . . . , h_{n} (\(1 \le h_{i} \le 10^{6}\)), the heights of the skyscrapers, in order.
Print a single line with the required number from the task.
| 서브태스크 | 점수 | 설명 |
|---|---|---|
1 | 11점 | n, \(k \le 100\) |
2 | 22점 | n, \(k \le 5000\) |
3 | 27점 | \(h_{i} \le 100\) |
4 | 18점 | n, \(k \le 5 \cdot 10^{4}\) |
5 | 32점 | No additional constraints. |
6 2
2 1 4 4 4 2484 1
7 3 9 481Clarification of the first example:
Domagoj photographed skyscrapers ( 4, 4, 4 ), so the total beauty is 4 · (4 + 4 + 4) = 48
Clarification of the second example:
Domagoj photographed only the skyscraper ( 9 ), so the total beauty is 9 · 9 = 81.
평가 및 의견
Neboderi
Log in to rate problems.
아직 의견이 없습니다. 자격이 된다면 위 양식에서 가장 먼저 평가해 보세요.
풀이 제출
Neboderi