| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 38708 | oTTo_22 | Gap (APIO16_gap) | C++14 | 0 ms | 0 KiB | 
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>
#include "gap.h"
#define se second
#define fi first
using namespace std;
long long findGap(int T, int N)
{
    long long &Mn,&Mx;
    long long S=0;
    long long T=1000000000000000000;
    while (Mn!=-1 && Mx!=-1) {
        MinMax(S,T,&Mn,&Mn);
        S=Mn;
        T=Mx;
    }
	return T-S;
}
