Submission #398028

#TimeUsernameProblemLanguageResultExecution timeMemory
398028dxz05Gap (APIO16_gap)C++14
0 / 100
1563 ms2064 KiB
#include "gap.h"
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 555555;

typedef long long ll;
ll a[MAXN];

long long findGap(int SUBTASK, int n){
    a[0] = -1;
    for (int i = 1; i <= n; i++){
        ll l = a[i - 1] + 1, r = 1e18;
        while (l <= r){
            ll m = (l + r) >> 1;
            ll mn, mx;
            MinMax(l, m, &mn, &mx);
            if (mx != -1){
                a[i] = m;
                r = m - 1;
            } else l = m + 1;
        }
    }

    ll ans = 0;
    for (int i = 1; i < n; i++){
        ans = max(ans, a[i + 1] - a[i]);
    }

	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...