제출 #343511

#제출 시각아이디문제언어결과실행 시간메모리
343511tengiz05Gap (APIO16_gap)C++17
30 / 100
52 ms2072 KiB
#include "gap.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; ll findGap(int T, int n){ ll ans = 0; ll l=0, r=1e18; vector<ll> a(n+1); ll mn, mx; int idl = 1, idr = n; while(idl <= idr){ //~ cout << idl << ' ' << idr << '\n'; MinMax(l, r, &mn, &mx); a[idl] = mn; a[idr] = mx; l = mn+1, r = mx-1; idl++; idr--; } for(int i=2;i<=n;i++)ans = max(ans, a[i]-a[i-1]); return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...