This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "gap.h"
#include<bits/stdc++.h>
using namespace std;
stack<long long> st;
vector<long long> arr;
long long findGap(int T, int N)
{
long long ans=LLONG_MIN;
long long mn=0,mx=1e18+1;
while(mn<mx-1){
MinMax(mn+1,mx-1,&mn,&mx);
if(mn==-1) break;
arr.push_back(mn);
if(mn!=mx) st.push(mx);
}
while(!st.empty()) arr.push_back(st.top()),st.pop();
for(int i=0;i<N-1;i++){
ans=max(ans,arr[i+1]-arr[i]);
}
//for(int i=0;i<N;i++) cout<<arr[i] <<" ";
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |