| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 705883 | Alihan_8 | Gap (APIO16_gap) | C++17 | 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"
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
//#define int long long
long long findGap(int T, int N){
int n = N;
if ( T == 1 ){
long long Mn = 0, Mx = 1e18+1, l = 0, r = n-1;
vector <long long> res(n);
while ( l <= r ){
MinMax(Mn+1, Mx-1, Mn, Mx);
res[l] = Mn, res[r] = Mx;
l++, r--;
}
Mx = 0;
for ( int i = 0; i+1 < n; i++ ){
Mx = max(Mx, res[i+1]-res[i]);
}
return Mx;
}
}
#if false
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n; cin >> n;
vector <int> p(n);
for ( auto &i: p ) cin >> i;
cout << findGap(0, n);
cout << '\n';
/*
4
2 3 6 8
*/
}
#endif