제출 #401660

#제출 시각아이디문제언어결과실행 시간메모리
401660BERNARB01Gap (APIO16_gap)C++17
30 / 100
50 ms1888 KiB
#include "gap.h" #include <bits/stdc++.h> using namespace std; long long findGap(int T, int N) { //if (T == 1) { long long lb = 0, rb = (long long) 1e18L; vector<long long> a(N); for (int i = 0; i < (N + 1) / 2; i++) { MinMax(lb, rb, &a[i], &a[N - 1 - i]); lb = a[i] + 1; rb = a[N - 1 - i] - 1; } 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...