# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1160365 | Kalata_56 | Gap (APIO16_gap) | C++20 | 0 ms | 0 KiB |
#include<bits/stdc++.h>
using namespace std;
long long mas[100001];
long long findGap(int T,int N){
long long maxa=1e18;
long long pre=0;
for(int i=0;i<N;i++){
long long k1,k2;
MinMax(pre+1,maxa,k1,k2);
mas[i]=k1;
pre=mas[i];
}
long long ans=maxa;
for(int i=0;i<N-1;i++){
ans=min(mas[i+1]-mas[i],ans);
}
return ans;
}