Submission #560775

#TimeUsernameProblemLanguageResultExecution timeMemory
560775messiuuuuuGap (APIO16_gap)C++14
0 / 100
52 ms1876 KiB
#include <bits/stdc++.h> #include "gap.h" #define task "B" #define ll long long #define ld long double #define fi first #define se second #define pb push_back using namespace std; const int MAXN = 1e5 + 5; const ll INF = 1e18 + 5; int n; ll a[MAXN]; void findGap(int t, int n) { ll l = 0, r = 1e18; for (int i = 1; i <= n && (n - i + 1) >= i; i++) { MinMax(l, r, &a[i], &a[n - i + 1]); l = a[i] + 1; r = a[n - i + 1] - 1; } ll ans = INF; for (int i = 2; i <= n; i++) { ans = min(ans, a[i] - a[i - 1]); } cout << ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...