Submission #336208

#	Time	Username	Problem	Language	Result	Execution time	Memory
336208		seedkin	Gap (APIO16_gap)	C11	30 / 100	51 ms	1920 KiB

gap

#include "gap.h"
#include <stdio.h>

long long arr[100001];

long long findGap(int T, int N)
{
	if(T == 1) {
		long long min = 0;
		long long max = 1e18;
		int minIdx = 0;
		int maxIdx = N-1;

		int maxIter = (N+1)/2;
		long long low;
		long long high;
		for(int i = 0; i < maxIter; i++) {
			MinMax(min, max, &low, &high);
			arr[minIdx++] = low;
			arr[maxIdx--] = high;
			min = low+1;
			max = high-1;
		}
		long long result = 0;
		for(int i =0; i < N-1; i++) {
			if(arr[i+1] - arr[i] > result ) result = arr[i+1] - arr[i];
		}
		// for(int i =0 ; i< N ; i++) {
		// 	printf("%lld ", arr[i]);
		// }
		// printf("\n");
		return result;
	}

	return 0;
}

• Subtask 1: 30 / 30
• Subtask 2: 0 / 70