Submission #106065

#TimeUsernameProblemLanguageResultExecution timeMemory
106065daniel920712Gap (APIO16_gap)C++14
48.54 / 100
107 ms1276 KiB
#include <iostream> #include <algorithm> #include "gap.h" using namespace std; long long findGap(int T,int N) { long long a,b,l=0,r=N-1,x=0,y=1000000000000000000 ,ans=0,c,d,t; MinMax(x,y,&a,&b); x=(b-a)/(N-1); if((b-a)%(N-1)) x++; t=a; for(;a<=b;a+=x) { l=a; r=min(b,a+x); MinMax(l,r,&c,&d); ans=max(ans,d-c); if(c!=-1) { ans=max(ans,c-t); t=d; } } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...