Submission #1011655

#TimeUsernameProblemLanguageResultExecution timeMemory
1011655ezzzayGap (APIO16_gap)C++14
0 / 100
28 ms5204 KiB
#include "gap.h" #include<bits/stdc++.h> using namespace std; #define ll long long #define pb push_back const int MN=2e6; ll arr[MN]; long long findGap(int T, int N){ int l=0,r=N-1; ll s=0,t=1e18; while(1){ ll mn,mx; MinMax(s,t,&mn,&mx); arr[l]=mn; arr[r]=mx; l++; r--; if(l+1==r or l==r)break; } ll ans=0; for(int i=1;i<N;i++){ ans=max(ans,arr[i]-arr[i-1]); } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...