제출 #464846

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
464846		MKutayBozkurt	Maxcomp (info1cup18_maxcomp)	C++14	100 / 100	137 ms	24648 KiB

maxcomp

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

#define int long long

int32_t main() {
  ios::sync_with_stdio(0); cin.tie(0);
  int n, m; cin >> n >> m;
  vector<vector<int>> a(n + 2, vector<int>(m + 2)), dp(n + 2, vector<int>(m + 2));
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      cin >> a[i][j];
    }
  }

  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      dp[i][j] = a[i][j];
      dp[i][j] = max(dp[i][j], dp[i - 1][j] - 1);
      dp[i][j] = max(dp[i][j], dp[i][j - 1] - 1);
    }
  }

  for (int i = n; i >= 1; i--) {
    for (int j = m; j >= 1; j--) {
      dp[i][j] = max(dp[i][j], dp[i + 1][j] - 1);
      dp[i][j] = max(dp[i][j], dp[i][j + 1] - 1);
    }
  }

  int ans = -1e9;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      ans = max(ans, dp[i][j] - a[i][j] - 1);
    }
  }
  cout << ans << '\n';
}

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