Submission #629888

#	Time	Username	Problem	Language	Result	Execution time	Memory
629888		hy_1	Gap (APIO16_gap)	C++14	0 / 100	40 ms	3620 KiB

gap

#include "gap.h"
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <cmath>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <unordered_map>

#define ll long long

long long findGap(int T, int N){
	ll n = N;
	ll arr[N];
	ll mn,mx;
	for(int i =0; i <= 1e18; i++){
		MinMax(i , i , &mn , &mx);
		arr[i] = mn;
	}

	ll ans = 0;
	for(int i =0; i<n-1; i++){
		ll y  = arr[i+1] - arr[i];
		// ans = max(ans , y);
		if(y > ans) ans = y;
	}
	return ans;
}

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