Найти наибольшее из значений элементов матрицы расположенных в заштрихованной части

#include <iostream>
#include <cstdlib>
#include <ctime>
using namespace std;
int main()
{
srand(static_cast<unsigned short int>(time(0)));
int n;
cin >> n;
const unsigned short int row = n;
const unsigned short int column = n;
unsigned short int** mas = new unsigned short int* [row];
for (int i = 0; i < n; i++)
mas[i] = new unsigned short int[column];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
mas[i][j] = rand() % 100;
}
}
for (int i = 0; i < row; i++) {
cout << " ";
for (int j = 0; j < n; j++) {
cout << mas[i][j] << "\t";
}
cout << endl;
}
unsigned short int max = 0;
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
for (short int i = n - 1; i >= 0; i--) {
for (short int j = n - i - 1; j < n; j++) {
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
if (i >= j) {
if (mas[i][j] >= max) max = mas[i][j];
}
}
}
cout << endl;
cout << max;
for (int i = 0; i < n; i++) delete mas[i];
delete[] mas;
return 0;
}

for (short int i = n - 1; i >= 0; i--) {
for (short int j = n - i - 1; j < n; j++) {

for (short int i = 0; i <n; i++) {
            for (short int j =0; j < n; j++)