Submission #464838

#TimeUsernameProblemLanguageResultExecution timeMemory
464838MKutayBozkurtMaxcomp (info1cup18_maxcomp)C++14
60 / 100
1086 ms16616 KiB
#include <iostream> #include <vector> #include <algorithm> using namespace std; #define int long long int32_t main() { ios::sync_with_stdio(0); cin.tie(0); int n, m; cin >> n >> m; vector<vector<int>> a(n, vector<int>(m)); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> a[i][j]; } } int ans = -1e9; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { for (int k = 0; k < n; k++) { for (int l = 0; l < m; l++) { int temp = max(a[i][j], a[k][l]) - min(a[i][j], a[k][l]); temp -= abs(i - k) + abs(j - l) + 1; ans = max(ans, temp); } } } } cout << ans << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...