Submission #161628

#TimeUsernameProblemLanguageResultExecution timeMemory
161628kostia244Gap (APIO16_gap)C++14
30 / 100
92 ms3900 KiB
#include "gap.h" #include<bits/stdc++.h> using namespace std; using ll = long long; long long findGap(int T, int N) { long long l = 1, r = 1e18, lp = 0, rp = N-1, x=0, y=0, a[100100]; for(int i = 0; lp<=rp; i++) { MinMax(l, r, &x, &y); a[lp] = x, a[rp] = y; l=x+1, r=y-1; lp++,rp--; } ll 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...