Submission #706798

#	Time	Username	Problem	Language	Result	Execution time	Memory
706798		600Mihnea	Gap (APIO16_gap)	C++17	30 / 100	49 ms	1864 KiB

gap

#include <cmath>
#include <functional>
#include <fstream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <list>
#include <time.h>
#include <math.h>
#include <random>
#include <deque>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <cassert>
#include <bitset>
#include <sstream>
#include <chrono>
#include <cstring>
#include <numeric>

#include "gap.h"

using namespace std;

long long findGap(int t, int n)
{
	long long ST = 0;
	long long DR = (long long)1e18;
	vector<long long> a(n);
	for (int i = 0; i <= n - 1 - i; i++)
	{
		MinMax(ST, DR, &ST, &DR);
		int j = n - 1 - i;
		a[i] = ST;
		a[j] = DR;
		ST++;
		DR--;
	}
	long long best_gap = a[1] - a[0];
	for (int i = 0; i + 1 < n; i++)
	{
		best_gap = max(best_gap, a[i + 1] - a[i]);
	}
	return best_gap;
}

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