# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1260574 | julia_08 | Gap (APIO16_gap) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
using ll = long long;
const int MAXN = 1e5 + 10;
ll a[MAXN];
ll findGap(int t, int n){
int l = 1, r = n;
ll s = 0, t = 1e18;
while(l < r){
MinMax(s, t, a[l], a[r]);
s = a[l] + 1;
t = a[r] - 1;
l ++;
r --;
}
ll ans = 0;
for(int i=1; i<n; i++) ans = max(ans, a[i + 1] - a[i]);
return ans;
}