题解 | #有序序列判断#

知识点：

复合类型：

一维数组

#include <iostream>
using namespace std;

int main() {
    int n;
    bool isSort = true;

    cin >> n;
    int arr[n];

    for (int i = 0; i < n; i++) {
        cin >> arr[i];
    }

    if ((arr[1] - arr[0]) == 0) {
        for (int i = 1; i < n-1; i++)
            if ((arr[i + 1] - arr[i]) != 0) {
                isSort = false;
                break;
            }
    } else if ((arr[1] - arr[0]) > 0) {
        for (int i = 1; i < n-1; i++)
            if ((arr[i + 1] - arr[i]) < 0) {
                isSort = false;
                break;
            }
    } else {
        for (int i = 1; i < n-1; i++)
            if ((arr[i + 1] - arr[i]) > 0) {
                isSort = false;
                break;
            }
    }

    if (isSort) {
        cout << "sorted";
    } else {
        cout << "unsorted";
    }

}