영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
시간 제한 1초 · 메모리 제한 512 MB
Problem
Bubble sort is a sorting algorithm that consists of a number of rounds. On each round the algorithm scans the array from left to right and swaps any adjacent elements that are in the wrong order.
Given an array of n integers, calculate the number of bubble sort rounds needed to sort the array.
Input
The first line has an integer n: the array size.
The next line has n integers x_1,x_2,…,x_n: the array contents.
Output
Print one integer: the number of rounds.
Constraints
- 1 ≤ n ≤ 2 · 10^5
- 1 ≤ x_i ≤ 10^9
Example
Explanation: Bubble sort needs three rounds to sort this array. The array contents after each round are [2,3,1,4,4], [2,1,3,4,4], and [1,2,3,4,4].
예제
예제 1
5 3 2 4 1 4
3