Problem: You are given a sequence of integers. Your task is to analyze the order of the elements in the sequence, print the sequence in reverse order, and determine the category of the sequence based on how the elements are arranged.



Categories

After reading the sequence, determine which of the following categories it belongs to:

A - Ascending Order  
   All elements are in strictly increasing order.

D - Descending Order  
   All elements are in strictly decreasing order.

B - Constant Order  
   All elements are equal.

N - None  
   The sequence does not belong to any of the above categories.



Your Task

1. Read an integer n representing the number of elements.
2. Read n integers into an array or vector.
3. Print the elements in reverse order.
4. Traverse the array to determine its category:
   - If every next element is greater than the previous, it is Ascending (A).
   - If every next element is smaller than the previous, it is Descending (D).
   - If all elements are equal, it is Constant (B).
   - Otherwise, it is None (N).
5. Print the corresponding category character after printing the reversed array.



Input Format

- An integer n.
- n integers representing the elements of the array.



Output Format

- First, print the array in reverse order with spaces.
- Then print a single character on a new line representing the category:
  A, D, B, or N.


Assumptions on Input

- 1 <= n <= 10^5
- Elements are integers.

Student submission:
#include <iostream>

using namespace std;


void max_to_end(int B[], int n) { 
int maxi=0;
for(int i=1; i<n; i++)
if(B[i] > B[maxi])
maxi = i;
swap(B[maxi],B[n-1]);
}

bool checka (int A[], int B[], int n) {
    bool val = true;
    for (int i = 0; i < n; i++) {
        if (A[i] != B[i]) {
            val = false;
            return val;
        }
    }
    return val;
}

bool checkd (int A[], int B[], int n) {
    bool val = true;
    for (int i = 0; i < n; i++) {
        if (A[i] != B[n - 1 - i]) {
            val = false;
            return val;
        }
    }
    return val;
}

bool checkn (int A[], int B[], int n) {
    bool val = true;
    for (int i = 0; i < n; i++) {
        if (A[i] != B[0]) {
            val = false;
            return val;
        }
    }
    return val;
}

int main() {
    int n, c;
    cin >> n;

    int nums[n];
    int B[n];

    for (int i = 0; i < n; i++) {
        cin >> c;
        nums[i] = c;
        B[i] = c;
    }



    for(int i = n-1; i >= 0; i--) {
        cout << nums[i] << ' ';
    }

    for (int i=n; i>0; i--) {
        max_to_end(B,i);
    }

    bool a, d, b;

    a = checka(nums, B, n);
    d = checkd(nums, B ,n);
    b = checkn(nums, B, n);

    if(b == true) {
        cout << endl << 'B' << endl;
    }

    if (a == true && b == false) {
        cout << endl << 'A' << endl;
    }

    if (d == true && b == false) {
        cout << endl << 'D' << endl;
    }

    if (a == false && d == false) {
        cout << endl << 'N' << endl;
    }
}

Grading criterion: Declaration of  array size and array
Rating A: correctly declares the flag variables, array/vector size and array/vector
Rating B: Some issue. 

Rating C: Major issue
Rating D: 0
Assigned grade: A