제출 #1076703

#제출 시각아이디문제언어결과실행 시간메모리
1076703laurasofiaGap (APIO16_gap)C++14
0 / 100
38 ms1580 KiB
#include "gap.h"
#include <bits/stdc++.h>

using namespace std;

#define vv vector<int>
#define ll long long
#define FOR(i,a,b) for(int i=a;i<b;i++)



long long findGap(int T, int N)
{

	ll l,r;
	MinMax(1,1e18,&l,&r);

	ll res=0;
	while(l+1<r-1){
		ll a,b;
		MinMax(l+1, r-1, &a, &b);
		if (a==-1)break;
		res=max({res, a-l, r-b});
		l=a;r=b;
	}
	res=max(res, r-l);
	return res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...