Submission #1149425

#TimeUsernameProblemLanguageResultExecution timeMemory
1149425Nuraly_SerikbayMaxcomp (info1cup18_maxcomp)C++17
60 / 100
1094 ms20060 KiB
#include <bits/stdc++.h> #define pb push_back using namespace std; int inf = 1e9 + 1; int a[3005][3005], n, m; struct st{ int val, i, j; }; vector<st> v; int main() { cin >> n >> m; for(int i = 1; i <= n; ++ i) { for(int j = 1; j <= m; ++ j) { cin >> a[i][j]; st temp; temp.val = a[i][j], temp.i = i, temp.j = j; v.pb(temp); } } int res = -inf; for(int i = 0; i < v.size(); ++ i) { for(int j = i; j < v.size(); ++ j) { res = max(res, (abs(v[i].val - v[j].val) - (abs(v[i].i - v[j].i) + abs(v[i].j - v[j].j) + 1))); //cout << i << ' ' << j << "-> " << (abs(v[i].val - v[j].val) - (abs(v[i].i - v[j].i) + abs(v[i].j - v[j].j) + 1)) << '\n'; } } cout << res; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...