题解 | 有序序列判断

#include <stdio.h>
int main()
{
	int n = 0; 
	int arr[200] = { 0 }; 
	int count1 = 0;
	int	count2 = 0;
	int count3 = 0;
	scanf("%d", &n); 
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &arr[i]);
	}
	for (int j = 0; j < n - 1; j++)
	{
		if (arr[j] < arr[j + 1])
		{
			count1++;
		}
		if (arr[j] > arr[j + 1])
		{
			count2++;
		}
		if (arr[j] == arr[j + 1])
		{
			count3++;
		}
	}
	if (count1 == n - 1|| count2 == n - 1 || count3 == n - 1)
	{
		printf("sorted\n");
	}
	else
	{
		printf("unsorted\n");
	}
	return 0; 
}