# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
718093 | irmuun | 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<bits/stdc++.h>
#include "gap.h"
using namespace std;
#define pb push_back
#define ll long long
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
const ll INF=1e18;
ll findGap(ll T,ll N){
vector<ll>v;
ll l=0;
ll r=INF;
for(ll i=1;i<=(N+1)/2;i++){
ll a,b;
MinMax(l,r,&a,&b);
v.pb(a);
if(a!=b){
v.pb(b);
}
l=a+1;
r=b-1;
}
sort(all(v));
ll ans=v[1]-v[0];
for(ll i=2;i<N;i++){
ans=max(ans,v[i]-v[i-1]);
}
return ans;
}