Submission #125332

#TimeUsernameProblemLanguageResultExecution timeMemory
125332kjp4155Gap (APIO16_gap)C++17
0 / 100
41 ms3832 KiB
#include "gap.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; ll MX = 1e18; ll A[500500]; ll findGap1(int N){ int L=1, R=N; while( L <= R ){ ll a,b; MinMax(0, MX, &a, &b); A[L++] = a; A[R--] = b; } ll ans = 0; for(int i=1;i<N;i++) ans = max(ans, A[i+1]-A[i]); return -1; } ll findGap2(int N){ return -1; } long long findGap(int T, int N){ if( T == 1 ) return findGap1(N); else return findGap2(N); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...