爆零求助
查看原帖
爆零求助
289587
Williamkong楼主2020/8/6 09:35

这里是代码

#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O2")
#define inf 0x7fffffff
#define pi acos(-1)
#define max(a,b) (a>b?a:b)
#define min(a,b) (a<b?a:b)
typedef long long ll;

int n;
int a[10005];
int ans;

int main()
{
	ios::sync_with_stdio(false);
   cin.tie(0);
	cout.tie(0);
	cin >> n;
	for (int i = 1; i <= n; i++) cin >> a[i];
	
	
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= i; j++)
			if (a[j] > a[j + 1])
			{
				swap(a[j], a[j + 1]);
				ans++;
			}
	
	cout << ans << endl;
	return 0;
}

望dalao指点!(QAQ)

2020/8/6 09:35
加载中...