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 "gap.h"
#include <bits/stdc++.h>
using namespace std;
long long findGap(int t,int n)
{
long long mn,mx;
MinMax(0,1e18,&mn,&mx);
long long prev = mn,ans = 0;
for(int i = 1;i < n;i++)
{
MinMax(prev+1,mx,&mn,&mx);
ans = max(ans,mn-prev);
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |