Submission #872965

#TimeUsernameProblemLanguageResultExecution timeMemory
872965StefanL2005Gap (APIO16_gap)C++14
30 / 100
37 ms4112 KiB
#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
#define ll long long

ll findGap(int T, int N)
{
    vector<ll> v(N);

    int p1 = 0, p2 = N - 1;
    ll a = -1, b = 1LL * 1000 * 1000 * 1000 * 1000 * 1000 * 1000+ 1;

    while (p1 <= p2)
    {
        ll c1, c2;
        MinMax(a + 1, b - 1, &c1, &c2);
        v[p1] = c1;
        v[p2] = c2;
        p1++; p2--;
        a = c1; b = c2;
    }


    ll maxDif = 0;
    for (int i = 1; i < N; i++)
        maxDif = max(maxDif, v[i] - v[i - 1]);

    return maxDif;
}


#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...