| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 156623 | a_player | Gap (APIO16_gap) | C++14 | 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>
#define f first
#define s second
#define mp make_pair
#define pb push_back
using namespace std;
typedef long long ll;
void MinMax(ll s,ll t,ll *mn,ll *mx);
ll mas=0;
ll v[100001];
ll findGap(int T,int N){
if(T==2){
ll n=-1LL;
int cont=0;
while(cont<N){
ll i=1LL;
ll a,b;
MinMax(n+1,n+i+1,a,b);
while(a==-1LL&&b==-1LL){
i*=2;
MinMax(n+1,n+i+1,a,b);
}
if(n>=0LL)mas=max(mas,a-n);
cont++;
n=a;}
return mas;}
ll a=0,b=1000000000000000000;
int i=0,j=N-1;
while(i<=j){
MinMax(a,b,a,b);
v[i]=a;
v[j]=b;
i++;
j--;
a++;
b--;
}
for(int i=0;i<N-1;i++)mas=max(mas,v[i+1]-v[i]);
return mas;
}