#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll INF=2e18;
#include "gap.h"
ll findGap(int T, int N)
{
if(T==1){
vector<ll>v(N);
ll l=0, r=INF, idl=0, idr=N-1;
while(idl<=idr){
ll a=-1, b=-1;
MinMax(l,r,&a,&b);
l=a; r=b;
v[idl]=l; v[idr]=r;
l++; r--;
idl++; idr--;
}
ll resp=0;
for(int i=1;i<N;i++) resp=max(resp,v[i]-v[i-1]);
return resp;
}else{
}
return 0;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |