Submission #39598

#TimeUsernameProblemLanguageResultExecution timeMemory
39598igziGap (APIO16_gap)C++11
30 / 100
59 ms5928 KiB
#include "gap.h" #include<bits/stdc++.h> #define ll long long #define pb push_back #define mp make_pair #define fi first #define se second using namespace std; ll a[101010],a1,a2,i,hs; long long findGap(int T, int N) { a[0]=-1; a1=0; a2=N+1; a[N+1]=1000000000000000002; for(i=1;i<=(N+1)/2;i++) { // cout<<"A"; MinMax(a[a1]+1,a[a2]-1,&a[a1+1],&a[a2-1]); a1++; a2--; } for(i=1;i<N;i++) hs=max(hs,a[i+1]-a[i]); // for(i=1;i<=N;i++) // cout<<a[i]<<" "; // cout<<"\n"; return hs; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...