제출 #1084433

#제출 시각아이디문제언어결과실행 시간메모리
1084433MMihalevGap (APIO16_gap)C++17
30 / 100
36 ms1196 KiB
#include<iostream>
#include<algorithm>
#include "gap.h"
using namespace std;
long long l=-1,r=1000000000000000001;
long long mn,mx;
int rem;
long long ans=1LL;
long long findGap(int T, int N)
{
    rem=N;
    while(rem>0)
    {
        MinMax(l+1,r-1,&mn,&mx);
        if(rem==2)ans=max(ans,mx-mn);
        if(l!=-1)
        {
            ans=max(ans,mn-l);
            ans=max(ans,r-mx);
        }
        if(mn!=mx)rem-=2;
        else rem--;
        l=mn;
        r=mx;
    }
    if(T==1)return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:27:1: warning: control reaches end of non-void function [-Wreturn-type]
   27 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...