제출 #1076436

#제출 시각아이디문제언어결과실행 시간메모리
1076436IcelastGap (APIO16_gap)C++17
30 / 100
28 ms1880 KiB
#include "gap.h" #include <iostream> #include <bits/stdc++.h> #define ll long long using namespace std; const ll maxn = 2*1e5+5, INF = 4e18+9; long long findGap(int T, int n) { ll ans = 0; if(T == 1){ ll l = 0, r = INF; ll mn, mx; vector<ll> a(n+1); for(int i = 1; i <= (n+1)/2; i++){ MinMax(l, r, &mn, &mx); a[i] = mn; a[n-i+1] = mx; l = mn+1, r = mx-1; } for(int i = 2; i <= n; i++){ ans = max(ans, a[i]-a[i-1]); } }else{ return 0; } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...