제출 #491428

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

long long findGap(int T, int N)
{
	long long arr[N] = {}, l = 0, r = N-1;
	for(; l <= r; l++, r--){
		if(l == 0) MinMax(0, 1e18, &arr[l], &arr[r]);
		else MinMax(arr[l-1]+1, arr[r+1]-1, &arr[l], &arr[r]);
	}

	long long ans = 0;
	for(int i = 0; i < N-1; i++){
		ans = max(ans, arr[i+1]-arr[i]);
	}

	// for(int i = 0; i < N; i++) cout << arr[i] << " \n"[i==N-1];

	return ans;

}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...