题解 | #有序序列判断#

#include<stdio.h>
int main() {
    int n, i, j, t, k;
    t = 0;
    k = 0;
    int a[50] = { 0 };
    scanf("%d", &n);
    for (i = 0; i <= n - 1; i++) {
        scanf("%d", &a[i]);
    }
    for (j = 0; j <= n - 2; j++) {
        if (a[j] <= a[j + 1]) {
            t++;
        }
    }
    for (j = 0; j <= n - 2; j++) {
        if (a[j] >= a[j + 1]) {
            k++;
        }
    }
    if (t == n - 1 || k == n - 1)
        printf("sorted");
    else
        printf("unsorted");
    return 0;
}