Submission #1011658

#TimeUsernameProblemLanguageResultExecution timeMemory
1011658ezzzayGap (APIO16_gap)C++14
30 / 100
36 ms5064 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(r>=l){ ll mn,mx; MinMax(s,t,&mn,&mx); arr[l]=mn; arr[r]=mx; s=mn+1; t=mx-1; l++; r--; } 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...