제출 #30777

#제출 시각아이디문제언어결과실행 시간메모리
30777NikeforGap (APIO16_gap)C++98
0 / 100
76 ms4240 KiB
#include "gap.h"
#include <algorithm>
#define inf (long long int)1<<60
using namespace std;
long long findGap(int T, int N)
{
	long long ans = 0;
	long long int s, t, mn, mx;
	s = 0;
	t = inf;
	long long mini = inf, maxi=0;
	while(t>=s) {
		MinMax(s,t,&mn,&mx);
		if(mn==-1 and mx==-1) { ans = max(ans, maxi-mini); break; }

		ans = max(ans, mn - mini);
		ans = max(ans, maxi - mx);
		if(mn==mx) break;
		mini = mn;
		maxi = mx;
		s = mini+1;
		t = maxi-1;
	}
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...