Submission #209574

#TimeUsernameProblemLanguageResultExecution timeMemory
209574LawlietGap (APIO16_gap)C++14
0 / 100
46 ms1144 KiB
#include "gap.h" #include <bits/stdc++.h> using namespace std; typedef long long int lli; const int MAXN = 100010; lli v[MAXN]; long long findGap(int T, int N) { lli L = 0; lli R = 1000000000000000000LL; for(int i = 1 ; N - i + 1 > i ; i++) { lli* mx = 0; lli* mn = 0; MinMax( L , R , mn , mx ); v[i] = *mn; v[N - i + 1] = *mx; L = v[i] + 1; R = v[N - i + 1] - 1; } lli ans = 0; for(int i = 1 ; i < N ; i++) ans = max( ans , v[i + 1] - v[i] ); return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...