Submission #464832

#	Time	Username	Problem	Language	Result	Execution time	Memory
464832		MKutayBozkurt	Maxcomp (info1cup18_maxcomp)	C++14	15 / 100	5 ms	332 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, vector<int>(m));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      cin >> a[i][j];
    }
  }
  int ans = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      for (int k = 0; k < n; k++) {
        for (int l = 0; l < m; l++) {
          int temp = max(a[i][j], a[k][l]) - min(a[i][j], a[k][l]);
          if (i == k && j == i) temp--;
          else if (i == k) temp -= abs(j - l) + 1;
          else if (j == l) temp -= abs(i - k) + 1;
          else temp -= abs(i - k) + abs(j - l) + 1;
          ans = max(ans, temp);
        }
      }
    }
  }
  cout << ans << '\n';
}

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