# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
50997 | alenam0161 | Gap (APIO16_gap) | C++17 | 83 ms | 3068 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 <iostream>
#include <algorithm>
#include <vector>
using namespace std;
long long findGap(int T, int N)
{
if (N == 0)return 0;
long long ans = 0;
long long inf = 1e18 + 1;
long long fi=-1;
long long se=inf;
vector<long long> a, b;
for(int i=0;i<(N+1)/2;++i){
MinMax(fi, se, &fi, &se);
if (fi == -1 || se == -1)break;
if(fi!=-1)
a.push_back(fi);
if(se!=fi)
b.push_back(se);
fi++;
se--;
if (fi >= se)break;
}
for (int i = b.size() - 1; i >= 0; i--)a.push_back(b[i]);
for (int i = 1; i < a.size(); ++i) {
ans = max(ans, a[i] - a[i - 1]);
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |