Submission #1160413

#TimeUsernameProblemLanguageResultExecution timeMemory
1160413Kalata_56Gap (APIO16_gap)C++20
0 / 100
28 ms1864 KiB
#include "gap.h"
//#include<bits/stdc++.h>;
long long mas[100011];
long long findGap(int T,int N){
    long long maxa=1e18+1;
    long long pre=0;
    long long ans=0;
    long long l=-1,r=maxa;
    long long L=0,R=N-1;
    while(L<=R){
        long long k1,k2;
        MinMax(l+1,r-1,&k1,&k2);
        mas[L]=k1;
        L++;
        mas[R]=k2;
        R--;
        l=k1;
        r=k2;
    }
    for(int i=0;i<N-1;i++){
        if(mas[i+1]-mas[i]>ans){
            ans=mas[i+1]-mas[i];
        }
    }
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...