# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1027785 | Gangsta | 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 ll long long
#define pb push_back
#define pii pair<ll,ll>
#define ff first
#define ss second
#define sz size()
const int N = 2e5 + 1;
using namespace std;
ll ans;
vector <ll> v, v1;
ll findGap(int t, int n){
ll mn, mx, l = 0, r = 1e18;
if(t == 1){
while(1){
if(l + 1 > r - 1) break;
MinMax(l + 1, r - 1, &mn, &mx);
if(mn == -1) break;
v.pb(mn);
v1.pb(mx);
l = mn;
r = mx;
}
for(int i = (int)v1.sz-1; i >= 0; i--) v.pb(v1[i]);
for(int i = 0; i < (int)v.sz-1; i++) ans = max(ans,v[i+1]-v[i]);
return ans;
}
}
int main(){
int n, t;
cin >> t >> n;
cout << findGap(t, n);
}