제출 #673447

#제출 시각아이디문제언어결과실행 시간메모리
673447S2speedGap (APIO16_gap)C++17
30 / 100
43 ms1872 KiB
#include<bits/stdc++.h> #include "gap.h" using namespace std; #pragma GCC optimize ("Ofast") #define all(x) x.begin() , x.end() #define sze(x) (ll)(x.size()) typedef long long ll; const ll maxn = 1e5 + 17 , md = 1e9 + 7; ll a[maxn] , mn , mx; ll findGap(int T , int n){ ll x = 0 , y = n , pn = 0 , px = 1e18; while(x < y){ MinMax(pn , px , &mn , &mx); a[x++] = mn; a[--y] = mx; pn = mn + 1; px = mx - 1; } ll ans = 0; for(ll i = 0 ; i < n - 1 ; i++){ ans = max(ans , a[i + 1] - a[i]); } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...