제출 #876132

#제출 시각아이디문제언어결과실행 시간메모리
876132vjudge1Gap (APIO16_gap)C++17
30 / 100
31 ms3108 KiB
#include "gap.h" #include<bits/stdc++.h> using namespace std; const int maxn=3e5; const int mod=1e9+7; long long findGap(int t, int n) { long long l=0; long long r=1e18; long long mn,mx; long long ans=0; long long a=0,b=0; MinMax(l,r,&mn,&mx); a=mn; l=mn+1; b=mx; r=mx-1; n-=2; while(l<=r) { if(n<=0)break; MinMax(l,r, &mn, &mx); ans=max(ans, mn-a); ans=max(ans, b-mx); a=mn; l=mn+1; b=mx; r=mx-1; n-=2; } ans=max(ans, b-a); return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...