제출 #1237750

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

maxcomp

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

const int inf = 1e9;
int n, m; 

void swap_up(vector<vector<int>> &a){
    vector<vector<int>> b(n, vector<int>(m));

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            b[i][j] = a[n - i - 1][j];
        }
    }

    a = b;
    return;
}

void swap_rl(vector<vector<int>> &a){
    vector<vector<int>> b(n, vector<int>(m));

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            b[i][j] = a[i][m - j - 1];
        }
    }

    a = b;
    return;
}

int doit(vector<vector<int>> &a){
    int mx = -10;

    vector<vector<int>> dp(n + 1, vector<int>(m + 1, -inf));
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            // cout << i << ' ' << j << ' ';
            dp[i][j] = 0 - a[i - 1][j - 1] + i - 1 + j - 1;
            // cout << a[i-1][j-1] << endl;
            dp[i][j] = max({dp[i][j], dp[i-1][j], dp[i][j-1]});
            mx = max({mx, a[i - 1][j - 1] - i + 1 - j + 1 + dp[i][j] - 1});
        }
    }

    return mx;
}

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

    int ans = -100;
    ans = max(doit(a), ans);
    swap_up(a);
    ans = max(doit(a), ans);
    swap_rl(a);
    ans = max(doit(a), ans);
    swap_up(a);
    ans = max(doit(a), 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: 40 / 40