제출 #95723

#제출 시각아이디문제언어결과실행 시간메모리
95723oolimryGap (APIO16_gap)C++14
0 / 100
50 ms1988 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;
    while(true){
        long long mn, mx;
        if(a > b) break;
        MinMax(a,b,&mn,&mx);
        //printf("%lld %lld\n",mn,mx);
        a = mn+1;
        b = mx-1;
        if(mn == -1) break;
        arr[x] = mn;
        arr[N-x-1] = mx;
        x++;
    }
    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...