Submission #956307

#TimeUsernameProblemLanguageResultExecution timeMemory
956307NeltGap (APIO16_gap)C++17
30 / 100
35 ms3868 KiB
#include "gap.h"
#include <bits/stdc++.h>
#define ll long long
#define endl "\n"
using namespace std;
ll solve(ll l, ll r)
{
    if (l == -1)
        return 0;
    ll mid = (l + r) >> 1, x, y, x1, y1;
    MinMax(l, mid, &x, &y);
    MinMax(mid + 1, r, &x1, &y1);
    return max({x != -1 ? solve(l, mid) : 0, x1 != -1 ? solve(mid + 1, r) : 0, x1 - y});
}
ll findGap(int t, int n)
{
    if (t == 1)
    {
        ll ans = 0;
        ll a[n];
        ll l = 0, r = 1e18, i = 0, j = n - 1;
        while (i <= j)
        {
            MinMax(l, r, &a[i], &a[j]);
            l = a[i++] + 1;
            r = a[j--] - 1;
        }
        for (ll i = 0; i + 1 < n; i++)
            ans = max(ans, a[i + 1] - a[i]);
        return ans;
    }
    return solve(0, 1e18);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...