제출 #274769

#제출 시각아이디문제언어결과실행 시간메모리
274769test2Gap (APIO16_gap)C++14
30 / 100
60 ms2040 KiB
#include <bits/stdc++.h> #include <stdlib.h> #include "gap.h" #define I inline void using ll = long long ; using ld = long double ; using namespace std ; const int mod = 1e9 + 7 ; long long findGap(int T, int N) { ll lo = 0, hi = 1e18 ; multiset<ll> s ; int l = 0 , r = N - 1; vector<ll> arr(N+1 , 0) ; while(l<=r){ ll mn ,mx ; MinMax(lo , hi , &mn , &mx) ; arr[l] = mn ; arr[r] = mx ; l++ ; r-- ; lo = mn + 1 ; hi = mx - 1; } ll ans = 0 ; for(int i =1 ;i < N ;i++) ans = max(ans , arr[i] - arr[i-1]) ; return ans ; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...