제출 #875571

#제출 시각아이디문제언어결과실행 시간메모리
875571NeroZeinGap (APIO16_gap)C++17
30 / 100
33 ms3712 KiB
#include "gap.h" #include "bits/stdc++.h" using namespace std; long long findGap(int T, int N) { long long lo = 0, hi = LLONG_MAX; int l = 0, r = N - 1; vector<long long> a(N); while (l <= r) { MinMax(lo, hi, &a[l], &a[r]); lo = a[l++] + 1, hi = a[r--] - 1; } long long ret = 0; for (int i = 1; i < N; ++i) { ret = max(ret, a[i] - a[i - 1]); } return ret; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...