#include<bits/stdc++.h>
using namespace std;

int main() {
	int n;
	cin >> n;
	int a[10086] = { 0 };
	int i = 0;
	for (; i < n; i++) {
		cin >> a[i];
	}
	int time = 0;
	for (int k = 0; k < n;k++) {
		for (int j = i-1; j >= 0; j--) {
			if (a[j] < a[j - 1]) {
				swap(a[j], a[j - 1]);
				time++;
			}
		}
	}
	cout << time << endl;
	return 0;
}

找规律

发现最少旋转次数就是冒泡排序的交换次数