제출 #1100317

#제출 시각아이디문제언어결과실행 시간메모리
1100317adkjtGap (APIO16_gap)C++14
0 / 100
43 ms2860 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/2;i++){
            MinMax(l,r,&pl,&pr);
            mx=max({mx,pl-l,r-pr});
            l=pl+1,r=pr-1;
        }

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