Submission #744920

#TimeUsernameProblemLanguageResultExecution timeMemory
744920amirhoseinfar1385Gap (APIO16_gap)C++17
0 / 100
47 ms1852 KiB
#include<bits/stdc++.h> #include "gap.h" using namespace std; long long findGap(int T, int N) { if(T==1){ vector<long long>all(N); long long mn=0,mx=1e18+5,fmn,fmx; int last=N-1,first=0; while(last>=first){ MinMax(mn+1,mx-1,&fmn,&fmx); mn=fmn; mx=fmx; all[last]=mx; all[first]=mn; last--; first++; } long long res=0; for(int i=1;i<=N;i++){ res=max(res,all[i]-all[i-1]); } return res; } else{ return 0; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...