# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
491428 | | Joo | Gap (APIO16_gap) | C++17 | | 43 ms | 1948 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)
{
long long arr[N] = {}, l = 0, r = N-1;
for(; l <= r; l++, r--){
if(l == 0) MinMax(0, 1e18, &arr[l], &arr[r]);
else MinMax(arr[l-1]+1, arr[r+1]-1, &arr[l], &arr[r]);
}
long long ans = 0;
for(int i = 0; i < N-1; i++){
ans = max(ans, arr[i+1]-arr[i]);
}
// for(int i = 0; i < N; i++) cout << arr[i] << " \n"[i==N-1];
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |