Submission #23284

#TimeUsernameProblemLanguageResultExecution timeMemory
23284repeatingGap (APIO16_gap)C++11
0 / 100
2000 ms5144 KiB
#include <bits/stdc++.h>
#define ll long long
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;
    ll res=0;
    ll l1=1e18,r1=0;
    while(l+1<=r-1){
        MinMax(l+1,r-1,l,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;
    }
    if(r1!=-1)
    res=max(res,r1-l1);
    return res;
}
//int main(){
//    cout<<findGap(1,2);
//}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...