제출 #24938

#제출 시각아이디문제언어결과실행 시간메모리
24938TAMREFGap (APIO16_gap)C++11
30 / 100
63 ms5144 KiB
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll findGap(int T, int N)
{
    ll mn,mx,tmn,tmx,ans=0;
	if(T==1){
        mn=0,mx=(ll)2e18;
        MinMax(mn,mx,&tmn,&tmx);
        if(N==2) return tmx-tmn;
        mn=tmn,mx=tmx;
        for(int i=1;2*i<=N-1;i++){
            MinMax(mn+1,mx-1,&tmn,&tmx);
            if(tmx==-1){
                ans=max(ans,mx-mn);
                break;
            }
            //printf("%lld %lld %lld %lld\n",mn,mx,tmn,tmx);
            ans=max(ans,max(tmn-mn,mx-tmx));
            mn=tmn,mx=tmx;
        }
        ans=max(mx-mn,ans);
        return ans;
	}
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...