#include "gap.h"
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define rng(i,l,r) for(int i=(l);i<(r);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrng(i,l,r) for(int i=(r)-1;i>=(l);i--)
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
long long findGap(signed T, signed N)
{
vector<int> L={-1},R={1000000000000000001LL};
int mn,mx;
rep(i,N/2){
MinMax(L.back()+1,R.back()-1,&mn,&mx);
L.push_back(mn);
if(mn!=mx)R.push_back(mx);
}
L.erase(L.begin()),R.erase(R.begin());
while(R.size()){
L.push_back(R.back());R.pop_back();
}
int ans=0;
rep(i,N-1)ans=max(ans,L[i+1]-L[i]);
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |