Submission #40770

#	Time	Username	Problem	Language	Result	Execution time	Memory
40770		Just_Solve_The_Problem	Gap (APIO16_gap)	C++11	0 / 100	82 ms	2284 KiB

gap

#include <bits/stdc++.h>
#include <gap.h>
                               
long long findGap(int t, int n) {
		long long left;
		long long right;
		left = 0;
		right = 1e18;
		long long mn, mx;        
		long long vec[n];
		int cnt = 0;
		int cn = n - 1;
		while (mn != mx) {
			MinMax(left, right, &mn, &mx);
			vec[cnt++] = mn; 
			if (mn != mx)
				vec[cn--] = mx;
			left = mn + 1;
			right= mx - 1;	
		}                  
		long long ans = 0;
		for (int i = 1; i < n; i++) {         
			if (vec[i] - vec[i - 1] > ans) {
				ans = vec[i] - vec[i - 1];
			}
		}
		return ans;
}

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