# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
95587 | rocketninja7 | 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 "gap.h"
long long findGap(int T, int N){
long long arr[N];
for(int i=0;i<(N+1)/2;i++){
long long s=0, t=1000000000000000000, mn, mx;
MinMax(s, t, *mn, *mx);
s=arr[i]=mn;
t=arr[N-1-i]=mx;
}
long long diff=0;
for(int i=1;i<N;i++){
diff=max(diff, arr[i]-arr[i-1]);
}
return diff;
}