atcoder#ARC119E. [ARC119E] Pancakes
[ARC119E] Pancakes
Score: points
Problem Statement
We have a pancake tower which is a pile of pancakes. Initially, the -th pancake from the top has a size of . Takahashi, a chef, can do the following operation at most once.
- Choose integers and and turn the -th through -th pancakes upside down, reversing the order.
Find the minimum possible ugliness of the tower after the operation is done (or not), defined below:
the ugliness is the sum of the differences of the sizes of adjacent pancakes; that is, the value $|A^{\prime}_1 - A^{\prime}_2| + |A^{\prime}_2 - A^{\prime}_3| + \cdots + |A^{\prime}_{N-1} - A^{\prime}_N|$, where is the size of the -th pancake from the top.
Constraints
- All values in input are integers.
Input
Input is given from Standard Input in the following format:
Output
Print the minimum possible ugliness of the tower.
5
7 14 12 2 6
17
If we do the operation choosing and , the pancakes will have the sizes of from top to bottom.
The ugliness here is $|7-6| + |6-2| + |2-12| + |12-14| = 1 + 4 + 10 + 2 = 17$. This is the minimum value possible; there is no way to achieve less ugliness.
3
111 119 999
888
In this sample, not doing the operation minimizes the ugliness.
In that case, the pancakes will have the sizes of from top to bottom, for the ugliness of .
6
12 15 3 4 15 7
19
If we do the operation choosing and , the pancakes will have the sizes of from top to bottom.
The ugliness here is $|12-15| + |15-15| + |15-4| + |4-3| + |3-7| = 3 + 0 + 11 + 1 + 4 = 19$, which is the minimum value possible.
7
100 800 500 400 900 300 700
1800
If we do the operation choosing and , the pancakes will have the sizes of from top to bottom, for the ugliness of .
10
535907999 716568837 128214817 851750025 584243029 933841386 159109756 502477913 784673597 603329725
2576376600