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)
{
long long mn = 0, mx = 1e18;
vector<long long> a(N);
int l = 0, r = N - 1;
while(l <= r)
{
MinMax(mn, mx, &mn, &mx);
// cout << "mn = " << mn << ", mx = " << mx << "\n";
a[l++] = mn;
a[r--] = mx;
mn += 1;
mx -= 1;
}
long long diff = 0;
for(int i = 1; i < N; i++)
{
diff = max(diff, a[i] - a[i - 1]);
}
return diff;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |