# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
713148 | bin9638 | 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>
#ifndef SKY
#include "gap.h"
#endif // SKY
using namespace std;
#define ll long long
#define pb push_back
#define N 100010
#define ii pair<int,int>
#define fs first
#define sc second
#define ld double
int n;
#ifdef SKY
ll a[N];
void MinMax(ll s,ll t, ll&mn, ll&mx)
{
if(s>t)
{
cout<<"NGU VC";
exit(0);
}
if(s>a[n]||a[lower_bound(a+1,a+1+n,s)-a]>t)
{
mn=-1;
mx=-1;
return;
}
mn=a[lower_bound(a+1,a+1+n,s)-a];
if(t>=a[n])
{
mx=a[n];
return;
}
mx=a[prev(upper_bound(a+1,a+1+n,t))-a];
}
#endif
long long findGap(int T, int cc)
{
n=cc;
ll L=0,R=1e18;
vector<ll>s;
while(L<=R)
{
ll u,v;
MinMax(L,R,u,v);
// cout<<L<<" "<<R<<" "<<u<<" "<<v<<endl;
if(u==-1)
break;
s.pb(u);
s.pb(v);
L=u+1;
R=v-1;
}
sort(s.begin(),s.end());
// s.erase(unique(s.begin(),s.end()),s.end());
// for(auto u:s)cout<<u<<" ";cout<<endl;
ll res=0;
for(int i=0;i<n-1;i++)
res=max(res,s[i+1]-s[i]);
return res;
}
#ifdef SKY
int main()
{
freopen("A.inp","r",stdin);
freopen("A.out","w",stdout);
int n,T;
cin>>T>>n;
for(int i=1;i<=n;i++)
cin>>a[i];
cout<<findGap(T,n)<<endl;
return 0;
}
#endif // SKY