Submission #882389

#	Time	Username	Problem	Language	Result	Execution time	Memory
882389		dubabuba	Gap (APIO16_gap)	C++14	0 / 100	33 ms	4656 KiB

gap

#include "gap.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
#define ff first
#define ss second

ll findGap(int T, int N) {
	ll L, R;
	MinMax(0LL, (ll)1e18, &L, &R);

	ll d = (R - L) / N;
	ll mn[N], mx[N];
	mn[0] = L, mx[N - 1] = R;

	ll st = L;
	for(int i = 0; i < N; i++)
		MinMax(st, (i == N - 1) ? N - 1 : st + d - 1, &mn[i], &mx[i]);
		
	ll ans = 0;
	for(int i = 1; i < N; i++)
		ans = max(ans, mn[i] - mx[i - 1]);
	return ans;
}

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