侏儒排序,TLE
查看原帖
侏儒排序,TLE
1135901
Programming_Konjac楼主2024/1/21 17:23
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e8 + 10;
int n, a[MAXN];
int main() {
    int n;
    cin>>n;
    for (int i = 1;i <= n; i++) scanf("%d", &a[i]);
    int s = 1;
    while(s <= n) {
        if(a[s - 1] <= a[s] || s == 0) s++;
        else swap(a[s], a[s - 1]), s--;
    }
    int ans = 0;
    for (int i = 1;i <= n; i++) cout<<a[i]<<" "; 
    return 0;
} 
2024/1/21 17:23
加载中...