#include <bits/stdc++.h>
using
namespace
std;
void
findType(
int
arr[],
int
n)
{
int
i = 0;
while
(i < n - 1 && arr[i] <= arr[i + 1])
i++;
if
(i == n - 1) {
cout <<
"Ascending with maximum element = "
<< arr[n - 1] << endl;
return
;
}
if
(i == 0) {
while
(i < n - 1 && arr[i] >= arr[i + 1])
i++;
if
(i == n - 1) {
cout <<
"Descending with maximum element = "
<< arr[0] << endl;
return
;
}
if
(arr[0] < arr[i + 1]) {
cout <<
"Descending rotated with maximum element = "
<< max(arr[0], arr[i + 1]) << endl;
return
;
}
else
{
cout <<
"Ascending rotated with maximum element = "
<< max(arr[0], arr[i + 1]) << endl;
return
;
}
}
if
(i < n - 1 && arr[0] > arr[i + 1]) {
cout <<
"Ascending rotated with maximum element = "
<< max(arr[i], arr[0]) << endl;
return
;
}
cout <<
"Descending rotated with maximum element "
<< max(arr[i], arr[0]) << endl;
}
int
main()
{
int
arr1[] = { 4, 5, 6, 1, 2, 3 };
int
n =
sizeof
(arr1) /
sizeof
(arr1[0]);
findType(arr1, n);
int
arr2[] = { 2, 1, 7, 5, 4, 3 };
n =
sizeof
(arr2) /
sizeof
(arr2[0]);
findType(arr2, n);
int
arr3[] = { 1, 2, 3, 4, 5, 8 };
n =
sizeof
(arr3) /
sizeof
(arr3[0]);
findType(arr3, n);
int
arr4[] = { 9, 5, 4, 3, 2, 1 };
n =
sizeof
(arr4) /
sizeof
(arr4[0]);
findType(arr4, n);
return
0;
}