# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1012166 | asdasdqwer | 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"
#include <bits/stdc++.h>
using namespace std;
long long findGap(int T, int N) {
set<long long> a;
long long mn = 0, mx = 1e18;
for (int i=0;i<(N+1)/2;i++) {
MinMax(mn, mx, mn, mx);
a.insert(mn);
a.insert(mx);
}
vector<long long> b;
for (long long x:a)b.push_back(x);
long long dif = 0;
for (int i=1;i<N;i++) {
dif = max(dif, b[i] - b[i-1]);
}
return dif;
}