제출 #197439

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
197439		GSmerch	Maxcomp (info1cup18_maxcomp)	C++14	0 / 100	2 ms	376 KiB

maxcomp

#include <bits/stdc++.h>

typedef long long ll;
typedef long double ld;


using namespace std;

#define fi first
#define se second
#define sz(x) (x).size()
#define pll pair<ll,ll >
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define endln '\n'
#define cont continue

const ll MaxN = 1e3 + 100;
const ll LogN = 20;
ll Inf = 1e18;
const ll dx[4] = { 0,1,0,-1 };
const ll dy[4] = { 1,0,-1,0 };

bool used[MaxN][MaxN];
ll Mt[MaxN][MaxN];

struct el{
    ll x, y, a;
};
int main() {

#ifdef LOCAL
	ifstream cin("input.txt");
	ofstream cout("output.txt");
#else
	//ifstream cin("points.in");
	//ofstream cout("points.out");
#endif
	ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    ll N, M;
    cin>>N>>M;
    ll Mx = 0;
    for(int i = 1;i<=N;i++){
        for(int j =1;j<=M;j++){
            cin>>Mt[i][j];
            used[i][j] = 1;
            Mx = max(Mx, Mt[i][j]);
        }
    }
    ll Ans = -Inf;
    for(int i = 1;i<=N;i++){
        for(int j =1;j<=M;j++){
            for(int k =0;k<4;k++){
                if(used[i+dx[k]][j + dy[k]]){
                    Ans = max(Ans, max(Mt[i][j],Mt[i+dx[k]][j+dy[k]]) - min(Mt[i][j],Mt[i+dx[k]][j+dy[k]]) - 2);
                }

            }
        }
    }
    cout<<Ans;






	return 0;
}

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