영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
시간 제한 1초 · 메모리 제한 512 MB
Problem
You have an array that contains a permutation of integers 1,2,…,n. Your task is to sort the array in increasing order by reversing subarrays. You can construct any solution that has at most n reversals.
Input
The first input line has an integer n: the size of the array. The array elements are numbered 1,2,…,n.
The next line has n integers x_1,x_2,…,x_n: the contents of the array.
Output
First print an integer k: the number of reversals.
After that, print k lines that describe the reversals. Each line has two integers a and b: you reverse a subarray from position a to position b.
Constraints
- 1 ≤ n ≤ 2 · 10^5
예제
예제 1
4 2 3 1 4
2 1 3 2 3