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 <bits/stdc++.h>
#define F first
#define S second
#define P push
#define pb push_back
#define MEM(dp,i) memset(dp,i,sizeof(dp))
#define W while
#define R return
#define C continue
#define SI size()
#define ll long long
#define pll pair<ll,ll>
#define SF(x) scanf("%I64d",&x)
using namespace std;
const long long INF = 2e9;
long long MOD = 1e9+7;
void MinMax(ll ,ll ,long long &,long long &);
void MinMax(ll s,ll t,long long &mn,long long &mx){
// cout<<s<<" "<<t<<endl;
// cin>>mn>>mx;
}
long long findGap(int,int);
long long findGap(int t,int n){
ll l=0,r=1e18;
vector<ll> v;
ll res=0;
ll l1=1e18,r1=0;
W(l<r){
MinMax(l+1,r-1,l,r);
if(l!=-1)v.pb(l);
if(r!=-1)v.pb(r);
if(r!=-1)res=max(res,max(r1-r,l-l1));
if(l==-1)res=max(res,r1-l1);
r1=r,l1=l;
if(l==-1)break;
}
R res;
}
//int main(){
// cout<<findGap(1,4);
//}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |