Submission #516814

#TimeUsernameProblemLanguageResultExecution timeMemory
516814CSQ31Gap (APIO16_gap)C++17
0 / 100
43 ms2676 KiB
#include "gap.h" #include <bits/stdc++.h> using namespace std; typedef long long int ll; long long findGap(int T, int N) { ll l = 0,r = 1e18; vector<ll>a,b; while(r>=l){ ll mn,mx; MinMax(l,r,&mn,&mx); if(mn==-1)break; if(mn==mx){ a.push_back(mn); break; }else{ a.push_back(mn); b.push_back(mx); } l = mn+1; r = mx-1; } reverse(b.begin(),b.end()); for(auto x:b)a.push_back(x); ll ans = 0; for(int i=0;i+1<N;i++)ans = max(ans,a[i+1]-a[i]); return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...