|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||256 MB||0||0||0||0.000%|
Mirko is playing a game of marbles. This is no ordinary game. In this game there are n bins placed from left to right. In each bin there is a number of marbles. In one move, Mirko can move a single marble from a bin to a directly adjacent bin. An adjacent bin is one that shares a side. He can move the same marble multiple times, but it’s considered a different move every time. At the end of the game, the score is the calculated by adding up the absolute value of the difference in the number of marbles between each pair of adjacent bins.
Consider this example:
If the game ended this way, Mirko’s score would be:
|9-8|+|8-3|+|3-2|+|2-7|+|7-2|+|2-3|+|3-4|+|4-6| = 1 + 5 + 1 + 5 + 5 + 1 + 1 + 2 = 21
Mirko would like to maximize his score, and then minimize the number of moves to achieve this score. Find these two values.
Each input will consist of a single test case. Note that your program may be run multiple times on different inputs. Each test case will begin with a single integer n (1 ≤ n ≤ 100,000) indicating the number of bins. On the next line there will be n integers m (0 ≤ m ≤ 1,000), with a single space between them, indicating the number of marbles in each bin, in order from left to right.
Output a single line with two integers, separated by a single space. The first is the maximum score that Mirko can achieve, and the second is the minimum number of moves Mirko needs to get that score. Output no extra spaces.
2 2 3
5 2 0 20 0 2
5 9 1 2 1 9