Submission #95568

#TimeUsernameProblemLanguageResultExecution timeMemory
95568lycGap (APIO16_gap)C++14
30 / 100
47 ms1932 KiB
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

long long findGap(int T, int N)
{
    ll s, t, mn, mx;
    s = 0, t = (ll)1e18;
    ll arr[N];
    for (int i = 0; i < (N+1)/2; ++i) {
        MinMax(s, t, &mn, &mx);
        arr[i] = mn;
        arr[N-1-i] = mx;
        s = mn+1;
        t = mx-1;
        //cout << "FOUND " << mn << " " << mx << '\n';
    }
    //for (int i = 0; i < N; ++i) cout << arr[i] << ' ' ;cout << endl;

    ll ans = 0;
    for (int i = 1; i < N; ++i) {
        ans = max(ans, arr[i]-arr[i-1]);
    }
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...