oj.uz

Submission #523746

# Submission time Handle Problem Language Result Execution time Memory
523746 2022-02-08T06:02:14 Z maks007 Maxcomp (info1cup18_maxcomp) C++14
0 / 100
 1 ms 204 KB 
#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 = i+1; k < n; k ++) {
				for(int l = j+1; l < m; l ++) {

					ans = max(ans, g[i][j] - g[k][l] - (abs(i-k)+abs(j-l)+1));
				}
			}
		}
	}
	cout << ans;
	return false;
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -