제출 #524010

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

maxcomp

#include <bits/stdc++.h>
 
using namespace std;
 
#define inf -1e9
 
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];
	}
	vector <vector <int> > lu, ru, ld, rd;
	rd.resize(n, vector <int> (m, inf));
	lu.resize(n, vector <int> (m, inf));
	ru.resize(n, vector <int> (m, inf));
	ld.resize(n, vector <int> (m, inf));
	for(int i = 0; i < n; i ++) {
		for(int j = 0; j < m; j ++) {
			rd[i][j] = g[i][j] + i + j;
			if(i) rd[i][j] = min(rd[i][j], rd[i-1][j]); 
			if(j) rd[i][j] = min(rd[i][j], rd[i][j-1]);
		}
	}
	int ans = -1e9;
	for(int i = 0; i < n; i ++) {
		for(int j = 0; j < m; j ++) {
			ans = max(ans, g[i][j] - rd[i][j] - (i+j));
		}
	}
	cout << ans-1;
	return false;
}

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