제출 #468721

#제출 시각아이디문제언어결과실행 시간메모리
468721Carmel_Ab1Gap (APIO16_gap)C++17
30 / 100
52 ms1864 KiB
#include <bits/stdc++.h> using namespace std; #include "gap.h" typedef long long ll; typedef vector<ll>vl; //#include "grader.cpp" ll findGap(int T, int n){ vl a(n); for(ll l=0,r=1e18,i=0; i<=n-i-1; i++){ ll mn=-1,mx=-1; MinMax(l,r,&mn,&mx); a[i]=mn,a[n-i-1]=mx; l=mn+1,r=mx-1; } ll ans=0; for(int i=0; i<n-1; i++) ans=max(ans,a[i+1]-a[i]); return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...