제출 #523714

#제출 시각아이디문제언어결과실행 시간메모리
523714maks007Maxcomp (info1cup18_maxcomp)C++14
60 / 100
1010 ms12676 KiB
#include <bits/stdc++.h> using namespace std; int dis(pair <int,int>a, pair <int,int> b) { return abs(a.first - b.first) + abs(a.second - b.second); } int main(void) { int n, m; cin >> n >> m; vector <vector <int> > g(n, vector <int> (m)); for(int i = 0; i < n; i ++) { for(int j = 0; j < m; j ++) cin >> g[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 ++) { ans = max(ans, g[i][j] - g[k][l] - (abs(i-k)+abs(j-l)+1)); } } } } cout << ans; return false; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...