Submission #569711

#TimeUsernameProblemLanguageResultExecution timeMemory
569711Rasoul006Gap (APIO16_gap)C++17
0 / 100
51 ms1872 KiB
#include "gap.h"

#include <bits/stdc++.h>

#define endl "\n"

#define F first

#define S second

#define pb push_back

#define p push

#define mid (r+l)/2

#define lx n*2

#define rx n*2+1

typedef long long ll;

using namespace std;

const int S = 1e6+5;

const long long inf = 1e18;

long long findGap(int T, int N)
{
    ll a[N+9] , i = 0 , l = 0 , r = N , mn = 0 , mx = 1e18 , ans = 0 ;

    while (i<N/2 + (N%2))
    {
        MinMax (mn + 1 , mx-1 , &mn , &mx);

        a[l] = mn ;
        a[r] = mx ;
        l++;
        r--;
    }

    for (int j=0 ; j<N-1 ; j++)
    {
        ans = max(a[j+1] - a[j] , ans);
    }

    cout << ans << endl ;

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