题目链接:点击打开链接
#include<stdio.h>
#include<string.h>
#include<algorithm>
#define LL long long
using namespace std;
int main()
{
int n,i,s;
int a[250],b[5];
while(~scanf("%d",&n))
{
int l=0;
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
if(a[i]!=i)
b[l++]=min((a[i]-i+n)%n,(i-a[i]+n)%n);
}
if(l==0)
printf("0\n");
else if(l==2)
{
printf("%d\n",2*(b[0]-1)+1);
}
else
{
sort(b,b+l);
s=2*(b[0]-1)+2*(b[1]-1)+2;
printf("%d\n",s);
}
}
return 0;
}