# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
40690 | Hassoony | Gap (APIO16_gap) | C++14 | 57 ms | 2280 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 <stdio.h>
#include <stdlib.h>
#include<bits/stdc++.h>
using namespace std;
#include "gap.h"
static void my_assert(int k){ if (!k) exit(1); }
static int subtask_num, N;
static long long A[100001];
static long long call_count;
typedef long long ll;
typedef double D;
const ll inf=(1ll<<61);
const ll mod=1e9+7;
const int MX=2e5+9;
vector<ll>v;
ll findGap(int T, int n){
ll ans=0;
if(T==1){
ll l,r,a[MX];
l=0,r=n+1;
for(int i=0;i<n;i++)a[i]=-inf;
a[l]=-1;
a[r]=1e18+1;
for(int i=1;i<=(n+1)/2;i++){
MinMax(a[l]+1,a[r]-1,&a[l+1],&a[r-1]);
l++;r--;
}
for(int i=2;i<=l;i++)ans=max(ans,a[i]-a[i-1]);
for(int i=r+1;i<=n;i++)ans=max(ans,a[i]-a[i-1]);
if(l==r-1)ans=max(ans,a[r]-a[l]);
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |