Submission #69147

#TimeUsernameProblemLanguageResultExecution timeMemory
69147FedericoSGap (APIO16_gap)C++14
0 / 100
80 ms2676 KiB
#include "gap.h" #include <vector> #include <iostream> 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); 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...