# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
125330 | kjp4155 | 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>
typedef long long ll;
ll MX = 1e18;
ll A[500500];
// void MinMax(long long, long long, long long*, long long*);
ll findGap1(int N){
int L=1, R=N;
while( L <= R ){
ll a,b;
MinMax(0, MX, a, b);
A[L++] = a; A[R--] = b;
}
ll ans = 0;
for(int i=1;i<N;i++) ans = max(ans, A[i+1]-A[i]);
return -1;
}
ll findGap2(int N){
return -1;
}
long long findGap(int T, int N){
if( T == 1 ) return findGap1(N);
else return findGap2(N);
}