Submission #560811

#TimeUsernameProblemLanguageResultExecution timeMemory
560811abcvuitunggioGap (APIO16_gap)C++17
30 / 100
3096 ms1884 KiB
#include "gap.h" #include <bits/stdc++.h> using namespace std; long long findGap(int T, int N) { long long a[N],mn,mx,lo=0,hi=1000000000000000000,res=0; if (T==1){ for (int i=0;i<N&&i<=N-i-1;i++){ MinMax(lo,hi,&a[i],&a[N-i-1]); lo=a[i]+1; hi=a[N-i-1]-1; } for (long long i=0;i<N-1;i++) res=max(res,a[i+1]-a[i]); return res; } MinMax(lo,hi,&mn,&mx); long long cur=-1,h=(mx-mn+N-2)/(N-1); for (int i=mn;i<=mx;i+=h+1){ MinMax(i,i+h,&mn,&mx); if (mn==-1) continue; if (cur!=-1) res=max(res,mn-cur); cur=mx; } return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...