제출 #388975

#제출 시각아이디문제언어결과실행 시간메모리
388975David_MGap (APIO16_gap)C++14
0 / 100
66 ms1156 KiB
#include "gap.h" #include <bits/stdc++.h> using namespace std; #define ll long long const ll INF=1e18; ll findGap(int T, int N){ ll mn, mx; MinMax(0, INF, &mn, &mx); ll l=mn, ans=(mx-mn)/((ll)N-1)-1, Ans=0, MX=mn; for (ll i=0; i<=N; i++) MinMax(l+1+i*ans, l+1+(i+1)*ans, &mn, &mx), Ans=max(Ans, mn-MX), MX=max(MX, mx); return Ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...