영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
시간 제한 1초 · 메모리 제한 512 MB
Problem
You are given an array consisting of n distinct integers. On each move, you can swap any two adjacent values.
You want to transform the array into a pyramid array. This means that the final array has to be first increasing and then decreasing. It is also allowed that the final array is only increasing or decreasing.
What is the minimum number of moves needed?
Input
The first input line has an integer n: the size of the array.
The next line has n distinct integers x_1,x_2,…,x_n: the contents of the array.
Output
Print one integer: the minimum number of moves.
Constraints
- 1 ≤ n ≤ 2 · 10^5
- 1 ≤ x_i ≤ 10^9
Example
Explanation: You may swap the first two values which creates a pyramid array [1,2,5,3].
예제
예제 1
4 2 1 5 3
1