呜呜呜,全wa紫砂在线急!

P1116 车厢重组

建议用一种更简单的代码: ```cpp for(int i = 1; i <= n; i++){ for(int j = 1; j <= i; j++){ if(a[j] > a[i]){ cnt++; } } } ```
by LiAuPb @ 2023-02-22 16:48:45


@[wangzishan123](/user/848358) ```cpp #include<bits/stdc++.h> using namespace std; int a[10000],n,cnt=0; int main(){ cin>>n; for(int i=0;i<n;i++) cin>>a[i]; for(int i=0;i<n-1;i++){ for(int j=0;j<n-1;j++){ if(a[j]>a[j+1]){ swap(a[j],a[j+1]); cnt++; } }} cout <<cnt; return 0;} ```
by Loser_Syx @ 2023-02-22 16:53:49


@[Saint_ying_xtf](/user/852144) 好厉害!%%%
by 已注销ZEDx2z6T @ 2023-02-22 17:01:46


谢谢·-·
by wangzishan123 @ 2023-02-24 16:53:52


睿智代码 ``` #include<iostream> using namespace std; int main() { int n, ans = 0; cin >> n; int* a = new int[N]; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n-1; i++) { for (int j = 0; j < n-i-1; j++) { if (a[j] > a[j+1]) { int tmp = a[j]; a[j] = a[j+1]; a[j+1] = tmp; ans++; } } } cout << ans << endl; return 0; } ```
by 303YYDS @ 2023-05-20 20:01:46


|