360笔试题-移动排列
#include<iostream>
#include<cstdlib>
using namespace std;
int main()
{
int min = 10000;
int sum = 0;
long int N;
long int num[100000] = {0};
cin >> N;
for (int i = 1; i <= N; i++)
{
cin >> num[i];
}
for (int k = 1; k <= N; k++)
{
sum = 0;
for (int m = 1; m <= N; m++)
{
sum += abs(num[m] - m);
}
num[0] = num[1];
for (int j = 1; j < N; j++)
{
num[j] = num[j + 1];
}
num[N] = num[0];
if (sum < min)
min = sum;
}
cout << min << endl;
return 0;
}