望丰展?[使Mark](https://www.luogu.org/wiki/show?name=%E5%B8%AE%E5%8A%A9%EF%BC%9Amarkdown)
by sun_yh @ 2019-10-06 23:40:48
```cpp
#include<stdio.h>
int main() {
int n,times=0,i,j,med=0,a[10000]={0};
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d",&a[i]);
for(i=1;i<=n;i++){
while(a[i]!=i){
for(j=i+1;j<=n;j++) {
while(a[j]==i) {
med=a[j-1]; a[j-1]=a[j]; a[j]=med; times++;
}
}
}
}
printf("%d\n",times);
return 0;
}
```
by zimindaada @ 2019-10-07 08:00:24
复杂度有点高啊
by 血色黄昏 @ 2019-10-07 08:45:08