제출 #963629

#제출 시각아이디문제언어결과실행 시간메모리
963629AcanikolicGap (APIO16_gap)C++14
0 / 100
35 ms3108 KiB
#include <bits/stdc++.h>

#include "gap.h"

#define F first

#define S second

using namespace std;

const int N = 2e5 + 10;

const long long inf = 1000000000000000000ll;

/*long long a[N];
int n;

void MinMax(long long s,long long t,long long &mn,long long &mx) {
    for(int i = 1; i <= n; i++) {
        if(a[i] >= s) {
            mn = a[i];
            break;
        }
    }
    for(int i = 1; i <= n; i++) {
        if(a[i] <= t) mx = a[i];
    }
}*/

long long findGap(int t,int n) {
    long long L,R,res = 1e18;
    MinMax(0,inf,&L,&R);
    for(int i = 1; i < (n + 1) / 2; i++) {
        long long l = L,r = R;
        MinMax(l + 1,r - 1,&L,&R);
        if(L != -1) res = min(res,L - l);
        if(R != -1) res = min(res,r - R);
    }
    return res;
}

/*signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n;
    for(int i = 1; i <= n; i++) cin >> a[i];
    cout << findGap(1,n);
    return 0;
}
*/
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...