Submission #95740

#TimeUsernameProblemLanguageResultExecution timeMemory
95740oolimryGap (APIO16_gap)C++14
30 / 100
47 ms2040 KiB
#include "gap.h"
#include <bits/stdc++.h>
long long findGap(int T, int N)
{

    long long arr[N];
    int x = 0;
    long long a, b;
    a = 0;
    b = 1000000000000000005;
    long long mn, mx;
    while(true){
        MinMax(a,b,&mn,&mx);
        arr[x] = mn;
        arr[N-x-1] = mx;
        a = mn + 1;
        b = mx - 1;
        x++;
        if ((x >= (N+1)/2)) break;
    }
    long long mm = 0;
    for(int i = 0;i < N-1;i++){
        mm = std::max(mm,arr[i+1]-arr[i]);
    }
	return mm;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...