# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
110379 | Vardanyan | Gap (APIO16_gap) | C++14 | 70 ms | 1960 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 <algorithm>
using namespace std;
long long A[1000*100+1];
long long findGap(int T, int N)
{
long long s = 0;
long long t = 1000000000;
t*=t;
long long nax;
long long as = 0;
int tl = 1;
int tr = N;
long long l = s;
long long r = t;
while(tl<=tr){
long long ans;
long long mn,mx;
MinMax(l,r,&mn,&mx);
A[tl] = mn;
A[tr] = mx;
tl++;
tr--;
l = mn+1;
r = mx-1;
}
for(int i = 1;i<N;i++){
as = max(as,A[i+1]-A[i]);
}
// cout<<as<<endl;
return as;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |