Submission #946253

#TimeUsernameProblemLanguageResultExecution timeMemory
946253simona1230Gap (APIO16_gap)C++17
0 / 100
35 ms3620 KiB
#include <bits/stdc++.h>
#include "gap.h"
using namespace std;

long long a[200001];

long long findGap(int t,int n)
{
    long long int minn,maxx,ans=0;
    a[0]=-1;
    for(int i=1;i<=n;i++)
    {
        MinMax(a[i-1]+1,1e18,&minn,&maxx);
        a[i]=minn;
        //cout<<a[i]<<" "<<a[i-1]<<endl;
        if(i>1)ans=max(ans,a[i]-a[i-1]);
    }
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...