제출 #495019

#제출 시각아이디문제언어결과실행 시간메모리
495019jamezzzGap (APIO16_gap)C++17
30 / 100
46 ms1856 KiB
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

ll a[100005];

ll findGap(int T,int N){
	int l=0,r=N-1;ll cl=0,cr=1e18,mn,mx;
	while(l<=r){
		MinMax(cl,cr,&mn,&mx);
		a[l]=mn,a[r]=mx,cl=mn+1,cr=mx-1,++l,--r;
	}
	ll ans=0;
	for(int i=1;i<N;++i)ans=max(ans,a[i]-a[i-1]);
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...