제출 #523635

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
523635		maks007	Maxcomp (info1cup18_maxcomp)	C++14	0 / 100	1 ms	296 KiB

maxcomp

#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+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};
			}
		}
	}
	for(int i = 1; i <= n; i ++) {
		for(int j = 1; j <= m; j ++) {
			if(g[i][j] < mn) {
				mn = g[i][j];
				mnid = {i, j};
			}else if(g[i][j] == mn and dis({i, j}, mxid) < dis(mnid, mxid)) {
				mn = g[i][j];
				mnid = {i, j};
			}
		}
	}
	cout << mx - mn - (dis(mxid, mnid));
	return false;
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 15
• Subtask 3: 0 / 30
• Subtask 4: 0 / 40