Submission #30770

#TimeUsernameProblemLanguageResultExecution timeMemory
30770NikeforGap (APIO16_gap)C++98
0 / 100
76 ms4240 KiB
#include "gap.h" #include <algorithm> #include <cmath> using namespace std; long long findGap(int T, int N) { long long ans = 0; long long a = pow(10,18); long long int s, t; long long int mn; long long int mx; MinMax(0,a,&mn,&mx); long long mini = mn; long long maxi = mx; s = mini+1; t = maxi-1; while(t>=s) { MinMax(s,t,&mn,&mx); if(mn==-1 and mx==-1) { ans = max(ans, maxi-mini); break; } ans = max(ans, mn - mini); ans = max(ans, maxi - mx); if(mn==mx) break; mini = mn; maxi = mx; s = mini+1; t = maxi-1; } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...