제출 #1100328

#제출 시각아이디문제언어결과실행 시간메모리
1100328adkjtGap (APIO16_gap)C++14
30 / 100
29 ms2868 KiB
#include "gap.h"
#include<bits/stdc++.h>
#define ll long long
using namespace std;

ll pl,pr;
ll l=0,r=1e18;
long long findGap(int T, int N)
{
    ll mx=0;
    if(T==1)
    {


        MinMax(l,r,&pl,&pr);
        l=pl,r=pr;
        for(int i=1;i<=(N+1)/2-1;i++){
            MinMax(l+1,r-1,&pl,&pr);
            if(pl!=-1)
            mx=max(mx,abs(pl-l)),l=pl;
            if(pr!=-1)
            mx=max(mx,abs(pr-r)),r=pr;

            //cout<<l<<' '<<pl<<' '<<r<<' '<<pr<<'\n';
        }

    }
    mx=max(mx,r-l);
	return mx;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...