영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
시간 제한 1초 · 메모리 제한 512 MB
Problem
Here are some possible methods using which we can sort the elements of an array in increasing order:
- At each step, choose two adjacent elements and swap them.
- At each step, choose any two elements and swap them.
- At each step, choose any element and move it to another position.
- At each step, choose any element and move it to the front of the array.
Given a permutation of numbers 1,2,…,n, calculate the minimum number of steps to sort the array using the above methods.
Input
The first input line contains an integer n.
The second line contains n integers describing the permutation.
Output
Print four numbers: the minimum number of steps using each method.
Constraints
- 1 ≤ n ≤ 2 · 10^5
예제
예제 1
8 7 8 2 6 5 1 3 4
20 6 5 6