题解 | #有序序列判断#

//BC122 有序序列判断
#include<stdio.h>
void arr_s(int arr[], int n)
{
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &arr[i]);   
	}
}

void arr_sort(int arr[], int n)
{
	int count1 = 0;
	int count2 = 0; 
	for (int i = 0; i < n - 1; i++)
	{
		if ((arr[i] <= arr[i + 1]))
			count1++; 
		else if ((arr[i] >= arr[i + 1]))
			count2++;
	}

	if (count1 == n - 1 || count2 == n - 1)
		printf("sorted\n");
	else
		printf("unsorted\n");
}

int main()
{
	int n = 0; 
	int arr[100] = { 0 }; 
	scanf("%d", &n);
	arr_s(arr, n); 
	arr_sort(arr, n); 
	return 0; 
}