Submission #171481

#TimeUsernameProblemLanguageResultExecution timeMemory
171481HBK_WasiGap (APIO16_gap)C++14
0 / 100
59 ms3836 KiB
/** e==m*pow(c,2) **/ #include <bits/stdc++.h> #include "gap.h" #define int long long using namespace std; int ara[100009]; long long findGap(int32_t T, int32_t N) { ara[0]=-1; ara[N+1]=1e18+2; int lo=0, hi=N+1, a, b; while(lo<hi-1) { MinMax(ara[lo]+1, ara[hi]-1, &a, &b); ara[++lo]=a; ara[--hi]=b; } int mn=0; for(int i=1;i<N;i++) mn=max(mn, ara[i+1]-ara[i]); return mn; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...