Submission #24966

#	Time	Username	Problem	Language	Result	Execution time	Memory
24966		gabrielsimoes	Gap (APIO16_gap)	C++14	0 / 100	73 ms	4904 KiB

gap

#include "gap.h"
#include <cstdio>
#include <algorithm>
using namespace std;

typedef long long ll;
const ll MIn = 0, MAX = 1000000000000000000;

ll solve1(int n) {
	ll v[n+1];
	int i = 1, k = n;
	ll mn = MIn, mx = MAX;
	while (i <= k) {
		MinMax(mn, mx, v+i, v+k);
		mn = v[i++]+1;
		mx = v[k--]-1;
	}

	ll ret = 1;
	for (int i = 1; i < n; i++)
		ret = max(ret, v[i+1] - v[i]);
	return ret;
}

ll solve2(int n) {
	return solve1(n);
}

ll findGap(int t, int n)
{
	printf("%lld\n", t == 1 ? solve1(n) : solve2(n));
}

Compilation message (stderr)

gap.cpp: In function 'll findGap(int, int)':
gap.cpp:32:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

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