제출 #955616

#제출 시각아이디문제언어결과실행 시간메모리
955616sleepntsheepGap (APIO16_gap)C11
70 / 100
43 ms1388 KiB
#include "gap.h"

long long findGap(int t, int n)
{
    long long mn,mx;
    MinMax(-1e18,1e18,&mn,&mx);
    long long k=mx-mn;
    long long x = (k+n-1)/n;

    long long z=x,l=mn,ll=l;

    while(l<mx)
    {
        long long p,q;
        MinMax(l+1,l+x,&p,&q);
        if(~p)
        {
            if(p-ll>z)z=p-ll;
            ll=q;
            l+=x;
        }
        else
        {
            l+=x;
        }
    }

	return z;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...