题解 | 有序序列判断

#include <stdio.h>

int main() {
    int N;
    int arr[50];
    int count = 0;
    scanf("%d", &N);
    for (int i = 0; i < N; i++) {
        scanf("%d", &arr[i]);
    }
    int count2 = 0;
    for (int j = 0; j < N-1; j++) {
        if (arr[j] >= arr[j + 1]) {
           count ++;
        }
        else{
            count2 ++;
        }
    }
    if(count ==N-1||count2 ==N-1){
    printf("sorted");
    }
    else{
        printf("unsorted");
    }

    return 0;
}