Submission #489783

#TimeUsernameProblemLanguageResultExecution timeMemory
489783marcoskalGap (APIO16_gap)C++14
0 / 100
3106 ms524292 KiB
#include "gap.h" #include <bits/stdc++.h> long long findGap(int T, int N) { long long first, last, first1, last1; MinMax(0, 1000000000000000001ll, &first, &last); long long step=(last-first)/(N-1); std::vector<long long> v; v.push_back(first); long long ans=step, cntr=0; for(int i=first;i<=last+1;i+=step) { //cout<<i+1<<" "<<i+step<<" "<<endl; MinMax(i+1, i+step, &first1, &last1); if(first1!=-1){ v.push_back(first1); cntr++; } if(last1!=-1&&last1!=first1){ v.push_back(last1); cntr++; } ans=std::max(ans, v[cntr]-v[cntr-1]); } //for(int i=0;i<v.size();i++) //cout<<v[i]<<" "; //cout<<endl; return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...