제출 #171482

#제출 시각아이디문제언어결과실행 시간메모리
171482HBK_WasiGap (APIO16_gap)C++14
30 / 100
58 ms2444 KiB
/** e==m*pow(c,2) **/
#include <bits/stdc++.h>
#include "gap.h"
#define int long long int
using namespace std;
int ara[100009];

long long findGap(int32_t T, int32_t N)
{
    ara[0]=-1;
    ara[N+1]=1000000000000000003LL;
    int lo=0, hi=N+1, a, b;
    while(lo<hi-1)
    {
        MinMax(ara[lo]+1, ara[hi]-1, &a, &b);
        ara[++lo]=a;
        ara[--hi]=b;
    }
    int mn=0;
    for(int i=1;i<N;i++) mn=max(mn, ara[i+1]-ara[i]);
    return mn;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...