# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
39588 | 2018-01-16T17:07:22 Z | igzi | Gap (APIO16_gap) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> long long findGap(int t,long long n){ long long l=0,d=n,x=-1,y=1e18+1,a[100002],m=0; for(int i=0;i<n;i++){ a[i]=-1; } while(y!=-1){ MinMax(x+1,y-1,&x,&y); a[l]=x; a[d]=y; l++; d++; } for(int i=1;i<n;i++){ if(a[i]!=-1 && a[i-1]!=-1 && a[i]-a[i-1]>m) m=a[i]-a[i-1]; } return m; }