Submission #95566

#TimeUsernameProblemLanguageResultExecution timeMemory
95566jamielimGap (APIO16_gap)C++14
30 / 100
48 ms2208 KiB
#include <bits/stdc++.h>
#include "gap.h"
using namespace std;

long long findGap(int T,int N){
    long long arr[N];
    int a=0,b=N-1;
    long long s=0,t=1000000000000000000;
    long long mn,mx;
    while(a<=b){
        MinMax(s,t,&mn,&mx);
        arr[a]=mn;
        arr[b]=mx;
        s=mn+1;
        t=mx-1;
        a++; b--;
    }
    long long 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...