제출 #1344818

#제출 시각아이디문제언어결과실행 시간메모리
1344818ramzialoulouGap (APIO16_gap)C++20
0 / 100
27 ms1968 KiB
#include <bits/stdc++.h>
#include "gap.h"

using namespace std;

long long findGap(int T, int N) {
  vector<long long> a(N);
  long long l = -1, r = (long long) 1e18 + 1;
  for (int i = 0; i <= N / 2; i++) {
    long long mn = l, mx = r;
    assert(l + 1 <= r - 1);
    MinMax(l + 1, r - 1, &l, &r);
    if (mn == mx) {
      a[i] = a[N - i - 1] = mn;
    } else {
      a[i] = l;
      a[N - 1 - i] = r;
    }
  }
  long long ans = 0;
  for (int i = 1; i < N; i++) {
    ans = max(ans, a[i] - a[i - 1]);
  }
  return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...