제출 #1236335

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1236335		khome	Maxcomp (info1cup18_maxcomp)	C++20	60 / 100	1094 ms	8264 KiB

maxcomp

#include <bits/stdc++.h>
using namespace std;

void solve(){
    int n, m; cin >> n >> m;
    vector<vector<int> > a(n, vector<int>(m)), vis(n, vector<int>(m, 0));
    
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cin >> a[i][j];
        }
    }

    vector<pair<int, int>> nei;
    nei = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
    int ans = -5;

    auto path = [&](auto&& path, int sz, int mn, int mx, int i, int j, set<pair<int, int>> st) -> void {
        st.insert({i, j});
        ans = max(ans, mx - mn - sz);
        for (auto [x, y] : nei) {
            int u = i + x, v = j + y;
            if (u < 0 || u >= n || v < 0 || v >= m) continue;
            if (a[u][v] >= mn && st.find({u, v}) == st.end()) path(path, sz + 1, mn, max(mx, a[u][v]), u, v, st);
        }
        return;
    };

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            for (int x = 0; x < n; x++) {
                for (int y = 0; y < m; y ++) {
                    if (x == i && y == j) continue;
                    ans = max(max(a[i][j], a[x][y]) - min(a[i][j], a[x][y]) - (abs(i - x) + abs(y - j) + 1), ans);
                } 
            }
        }
    }

    cout << ans << endl;
}

int main() {
    int t = 1;
    // cin >> t;
    while (t -- ) solve();
}

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