Submission #371372

#TimeUsernameProblemLanguageResultExecution timeMemory
371372SortingGap (APIO16_gap)C++17
30 / 100
54 ms1260 KiB
#include "gap.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
using namespace std;

const ll INF = 1e18;

int t, n;

ll solve_1(){
    ll l, r, ans = 0;
    MinMax(0, INF, &l, &r);

    ll l2, r2;
    n -= 2;
    while(n > 0){
        MinMax(l + 1, r - 1, &l2, &r2);
        ans = max(ans, max(l2 - l, r - r2));
        l = l2, r = r2;
        n -= 2;
    }
    ans = max(ans, r - l);
    return ans;
}

ll findGap(int _t, int _n){
	t = _t, n = _n;
    return solve_1();
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...