제출 #560751

#제출 시각아이디문제언어결과실행 시간메모리
560751abcvuitunggioGap (APIO16_gap)C++17
30 / 100
54 ms1992 KiB
#include "gap.h" #include <bits/stdc++.h> using namespace std; long long findGap(int T, int N) { long long a[N],lo=0,hi=1000000000000000000; if (T==1){ for (int i=0;i<=N-i-1;i++){ MinMax(lo,hi,&a[i],&a[N-i-1]); lo=a[i]+1; hi=a[N-i-1]-1; } long long res=0; for (int i=0;i<N-1;i++) res=max(res,a[i+1]-a[i]); return res; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...