제출 #560841

#제출 시각아이디문제언어결과실행 시간메모리
560841abcvuitunggioGap (APIO16_gap)C++17
100 / 100
59 ms1872 KiB
#include "gap.h" #include <bits/stdc++.h> using namespace std; long long findGap(int T, int N) { long long a[N],mn,mx,mn2,mx2,lo=0,hi=1e18,res=0; if (T==1){ for (long long 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); if (N==2){ return mx-mn; } long long cur=mn,h=(mx-mn+N-2)/(N-1); for (long long i=mn;i<=mx;i+=h+1){ MinMax(i,i+h,&mn2,&mx2); if (mn2==-1) continue; res=max(res,mn2-cur); cur=mx2; } return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...