Submission #95592

#TimeUsernameProblemLanguageResultExecution timeMemory
95592rocketninja7Gap (APIO16_gap)C++14
0 / 100
63 ms1932 KiB
#include "gap.h"
#include <algorithm>
using namespace std;
long long findGap(int T, int N){
    long long arr[N];
    for(int i=0;i<(N+1)/2;i++){
        long long s=0, t=1000000000000000000, mn, mx;
        MinMax(s, t, &mn, &mx);
        s=arr[i]=mn;
        t=arr[N-1-i]=mx;
    }
    long long diff=0;
    for(int i=1;i<N;i++){
        diff=max(diff, arr[i]-arr[i-1]);
    }
	return diff;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...