Submission #69149

#TimeUsernameProblemLanguageResultExecution timeMemory
69149FedericoSGap (APIO16_gap)C++14
0 / 100
81 ms2612 KiB
#include "gap.h"
#include <vector>
#include <iostream>
#include <assert.h>
using namespace std;
typedef long long ll;

ll INF=1000000000000000000;
ll x,y;
vector<ll> V;

long long findGap(int T, int N)
{

	for(int i=0;i<N;i++){
		MinMax(x,INF,&x,&y);
		V.push_back(x);
		assert(x!=-1);
		x++;
	}

	x=0;
	for(int i=0;i<N-1;i++)
		x=max(x,V[i+1]-V[i]);

	return x;
}

/*
1 6
1 2 5 7 8 12
*/
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...