稍等
by 据设错了 @ 2018-08-08 17:05:50
![](C:\Users\Administrator\Desktop)
by 据设错了 @ 2018-08-08 17:10:04
![你看看](C:\Users\Administrator\Desktop)
by 据设错了 @ 2018-08-08 17:10:32
希望更丰富的展现?使用Markdown
by Mickey_jj @ 2019-02-25 13:44:12
#include<iostream>
using namespace std;
const int MAXN=10001;
int main()
{
int n,i,j,s=0;
bool ok;
float temp,a[MAXN];
cin>>n;
for(i=0;i<n;i++)
cin>>a[i];
for(i=n-1;i>=1;i--)
{
ok=true;
for(j=0;j<i;j++)
if(a[j]>a[j+1])
{
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
ok=false;
s++;
}
if(ok==true)break;
}
cout<<s<<endl;
return 0;
}
by wangyidi @ 2019-08-13 13:07:05