Submission #241866

#TimeUsernameProblemLanguageResultExecution timeMemory
241866jiahngGap (APIO16_gap)C++14
30 / 100
63 ms2072 KiB
#include "gap.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<ll,ll> pi; typedef vector <ll> vi; typedef vector <pi> vpi; #define f first #define s second #define FOR(i,s,e) for(ll i=s;i<=ll(e);++i) #define DEC(i,s,e) for(ll i=s;i>=ll(e);--i) #define pb push_back #define all(x) (x).begin(), (x).end() #define lbd(x, y) lower_bound(all(x), y) #define ubd(x, y) upper_bound(all(x), y) #define aFOR(i,x) for (auto i: x) #define mem(x,i) memset(x,i,sizeof x) #define fast ios_base::sync_with_stdio(false),cin.tie(0) #define maxn 100001 ll arr[maxn]; long long findGap(int T, int N) { ll curs = 0, curt = 1e18; FOR(i,0,(N+1)/2 - 1){ MinMax(curs,curt,arr + i, arr + N - i - 1); curs = arr[i] + 1; curt = arr[N - i - 1] - 1; } ll ans = 0; FOR(i,0,N-2) ans = max(ans,arr[i+1] - arr[i]); return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...