while(1): try: n=int(input()) num=list(map(int,input().split())) k=sorted(num) k1=sorted(num,reverse=True) if num==k: print("Ascending") elif num==k1: print("Descending order") else...

#include <iostream> #include <algorithm> using namespace std; int n, a; vector<int> s, cpy; int main() { while (cin >> n) { s.clear(); cpy.clear(); while (n -- ) { cin >> a; s.push_back(a); } cpy = s; sort(cpy.begin(), cpy...