제출 #30744

#제출 시각아이디문제언어결과실행 시간메모리
30744kavunGap (APIO16_gap)C++14
0 / 100
56 ms5924 KiB
#include "gap.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; ll a[100010], mx; int n; long long findGap(int T, int N) { n = N; if(T == 1) { MinMax(0,1e18,a,a + n-1); for(int i = 1; i < n/2; i++) MinMax(a[0]+1,a[n-1]-1,a + i,a + n-1-i); } for(int i = 0; i < n-1; i++) mx = max(mx,a[i+1]-a[i]); return mx; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...