Submission #745413

#TimeUsernameProblemLanguageResultExecution timeMemory
745413AirCirclesGap (APIO16_gap)C++17
0 / 100
34 ms1920 KiB
#include "gap.h" #include <bits/stdc++.h> using namespace std; //void MinMax(s,t,&mn,&mx) long long findGap(int TT, int n){ //long long s,t,&mn,&mx; vector<long long>dn(n); MinMax(0,1000000000000000000LL,&dn[0],&dn[n-1]); for(int i=1;i<n/2;i++){ MinMax(dn[i-1],dn[n-i],&dn[i],&dn[n-i-1]); } if(n%2==1){ MinMax(dn[n/2-1],dn[n/2+1],&dn[n/2],&dn[n/2]); } long long mn=0LL; for(int i=0;i<n-1;i++){ mn=max(mn,dn[i+1]-dn[i]); } return mn; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...