This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector <vector <int>> g(n+2, vector <int> (m+2, -1));
int mx = -1e9;
int mn = 1e9;
pair <int,int> mxid, mnid;
for(int i = 1; i <= n; i ++) {
for(int j = 1; j <= m; j ++) {
cin >> g[i][j];
if(g[i][j] > mx) {
mx = g[i][j];
mxid = {i, j};
}
if(g[i][j] < mn) {
mn = g[i][j];
mnid = {i, j};
}
}
}
cout << mx - mn - (abs(mnid.first - mxid.first) + abs(mxid.second - mnid.second) + 1);
return false;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |