# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1073362 | Hugo1729 | Gap (APIO16_gap) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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,mr;
vector<ll> ans,sus2;
if(T==2)return 52345235;
while(s<t){
MinMax(s,t,ml,mr);
ans.push_back(ml);
sus2.push_back(mr);
s=ml;
t=mr;
}
for(int j=sus2.size()-1;j>=0;j--){
ans.push_back(sus2[j]);
}
ll out=0;
for(int i=0;i<N-1;i++){
out=max(out,ans[i+1]-ans[i]);
}
return out;
}