# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1146141 | hoangnoobpro | Gap (APIO16_gap) | C++20 | 0 ms | 0 KiB |
#include<bits/stdc++.h>
#include "gap.h"
using namespace std;
#define ll long long
long long findGap(ll T,ll N)
{
ll kq=0,x=0,y=1e18,a[100007],j,k;
if(T==1)
{
MinMax(x,y,&a[1],&a[n]);
j=2;
k=n-1;
while(j<=k)
{
MinMax(a[j-1],a[k+1],&a[j],&a[k]);
j++;
k--;
}
for(int i=2;i<=n;++i)kq=max(kq,a[i]-a[i-1]);
}
return kq;
}