# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
672270 | Dan4Life | Gap (APIO16_gap) | C++17 | 46 ms | 2240 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"
using namespace std;
//#define int long long
using ll = long long;
#define fi first
#define se second
#define pb push_back
#define all(a) a.begin(),a.end()
#define sz(a) (int)a.size()
const int maxn = 5e5+10;
const ll LINF = (ll)2e18;
long long findGap(int T, int N)
{
ll s=0, t=LINF,mn,mx,ans=0;
vector<ll> v; v.clear();
while(1){
MinMax(s,t,&mn,&mx);
if(mn!=-1) v.pb(mn);
if(mn>=mx or mn==-1) break; v.pb(mx);
s=mn+1,t=mx-1;
}
sort(all(v));
for(int i = 0; i < sz(v)-1; i++) ans = max(ans, v[i+1]-v[i]);
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |