每日一题 - 240412 - 对称排序

• 对称排序

---

• TAG - $芝士水题、算法-【模拟、排序】$
• 时间复杂度 - $O(N)$

//
#include <bits/stdc++.h>
using namespace std;
// #define int long long 

const int N = 1e5 + 6;
int in[N];

void solve() {
    int n;
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) scanf("%d", &in[i]);

    int i = 1, j = n;
    while (i < j) {
        if (in[i] > in[j]) swap(in[i], in[j]);
        i++, j--;
    }

    bool f = 1;
    for (int i = 2; i <= n; i++) {
        f &= (in[i - 1] <= in[i]);
    }
    printf("%s\n", f ? "YES" : "NO");
}

signed main() {
    int t = 1;
    // scanf("%d", &t);
    while (t--) solve();
    return 0;
}

---

实现细节

• `

---

参考示意图

• `

---

参考链接

• `

---

作者 | 乐意奥AI