Submission #1084435

#TimeUsernameProblemLanguageResultExecution timeMemory
1084435MMihalevGap (APIO16_gap)C++17
30 / 100
35 ms1232 KiB
#include<iostream>
#include<algorithm>
#include "gap.h"
using namespace std;
long long l=-1,r=1000000000000000001;
long long mn,mx;
int rem;
long long ans=1LL;
long long findGap(int T, int N)
{
    rem=N;
    while(rem>0)
    {
        if(l+1>r-1)break;
        MinMax(l+1,r-1,&mn,&mx);
        if(mn==-1)break;
        if(rem==2)ans=max(ans,mx-mn);
        if(l!=-1)
        {
            ans=max(ans,mn-l);
            ans=max(ans,r-mx);
        }
        if(mn!=mx)rem-=2;
        else rem--;
        l=mn;
        r=mx;
    }
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...