Submission #24967

#TimeUsernameProblemLanguageResultExecution timeMemory
24967gabrielsimoesGap (APIO16_gap)C++14
30 / 100
73 ms4900 KiB
#include "gap.h" #include <cstdio> #include <algorithm> using namespace std; typedef long long ll; const ll MIn = 0, MAX = 1000000000000000000; ll solve1(int n) { ll v[n+1]; int i = 1, k = n; ll mn = MIn, mx = MAX; while (i <= k) { MinMax(mn, mx, v+i, v+k); mn = v[i++]+1; mx = v[k--]-1; } ll ret = 1; for (int i = 1; i < n; i++) ret = max(ret, v[i+1] - v[i]); return ret; } ll solve2(int n) { return solve1(n); } ll findGap(int t, int n) { return t == 1 ? solve1(n) : solve2(n); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...