Submission #1073399

#TimeUsernameProblemLanguageResultExecution timeMemory
1073399Hugo1729Gap (APIO16_gap)C++11
30 / 100
38 ms4464 KiB
#include "gap.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; ll findGap(int T, int N){ ll s=0,t=1e18,ml=0,mr; vector<ll> ans,sus2; for(int i=0;i<N;i+=2){ MinMax(s,t,&ml,&mr); if(mr==-1)break; ans.push_back(ml); if(ml==mr)break; sus2.push_back(mr); s=ml+1; t=mr-1; } for(int j=sus2.size()-1;j>=0;j--){ ans.push_back(sus2[j]); } ll out=0; for(int i=0;i<N;i++){ out=max(out,ans[i+1]-ans[i]); } // for(int i : ans)cout << i << ' '; // cout << '\n'; return out; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...