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;
const int maxN = 1e5 + 20;
long long a[maxN];
long long findGap(int T, int N) {
if (T == 1) {
long long mi = 0;
long long mx = 1e18L;
int lt = 1;
int rt = N;
while (lt <= rt) {
MinMax(mi, mx, &mi, &mx);
a[lt] = mi;
a[rt] = mx;
mi++;
mx--;
lt++;
rt--;
}
long long res = 0;
for (int i = 1; i <= N - 1; i++) {
res = max(res, a[i + 1] - a[i]);
}
return res;
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |