Submission #30751

#TimeUsernameProblemLanguageResultExecution timeMemory
30751kavunGap (APIO16_gap)C++14
30 / 100
73 ms5924 KiB
#include "gap.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
ll a[100010], mx;
int n, val;


long long findGap(int T, int N)
{
  n = N;
  val = n % 2 ? n/2+1 : n/2;
  if(T == 1)
    {
      MinMax(0,1e18,a,a + n-1);
      for(int i = 1; i < val; i++)
	MinMax(a[i-1]+1,a[n-i]-1,a + i,a + n-1-i);
    }
  for(int i = 0; i < n-1; i++)
    mx = max(mx,a[i+1]-a[i]);
  return mx;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...