제출 #30745

#제출 시각아이디문제언어결과실행 시간메모리
30745ozaslanGap (APIO16_gap)C++14
0 / 100
53 ms4900 KiB
#include "gap.h"
#include <stdio.h>
#define maxN 1000000000

long long max(long long x, long long y) {return x > y ? x : y;}

long long findGap(int T, int N)
{
    long long d[100000];
	long long mn, mx, s, t;
	long long sol = 0, sag = maxN;


	int solIn = 0, sagIn = N-1;
	while (solIn < sagIn) {
      //  printf("Sol: %lld, sag: %lld, ", sol, sag);
		s = sol, t = sag;
		MinMax(s, t, &mn, &mx);
		//printf("mn: %lld, mx: %lld\n", mn, mx);
		d[solIn++] = sol = mn;
		d[sagIn--] = sag = mx;
        sol++, sag--;
	}

	long long fark = 0;

 /*   for (int i = 0; i < N; i++)
        printf("%d ", d[i]);
    printf("\n");
	*/for (int i = 1; i < N; i++)
		fark = max(fark, d[i] - d[i-1]);
	return fark;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...