Submission #655329

#TimeUsernameProblemLanguageResultExecution timeMemory
655329benjaminkleynGap (APIO16_gap)C++17
30 / 100
40 ms1916 KiB
#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
typedef long long ll;

ll a[100000];

ll findGap(int T, int N)
{
    ll lo = 0, hi = 1000000000000000000;
    int l = 0, r = N - 1;
    while (l <= r)
    {
        MinMax(lo, hi, &a[l], &a[r]);
        lo = a[l++] + 1;
        hi = a[r--] - 1;
    }
    ll mx = 0;
    for (int i = 0; i < N; i++)
        mx = max(mx, a[i+1] - a[i]);
    return mx;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...