Submission #45258

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
45258	2018-04-12 08:42:30	nibnalin	Gap (APIO16_gap)	C++17	46.91 / 100	116 ms	2276 KiB

gap

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <iostream>
#include <cstdio>
#include <vector>
#include "gap.h"
using namespace std;
typedef long long int lli;
const lli maxn = int(1e5)+5, inf = lli(1e18)+1;
lli ans = 0, A[maxn];
void sub1(lli n)
{
  pair<lli, lli> range = {0, inf};
  lli L = 0, R = n-1;
  while(L <= R)
  {
    MinMax(range.first, range.second, &A[L], &A[R]);
    range.first = A[L]+1, range.second = A[R]-1;
    L++, R--;
  }
  for(lli i = 1;i < n;i++) ans = max(ans, A[i]-A[i-1]);
}
void qry(lli L, lli R)
{
  //cout << L << " " << R << "\n";
  if(R-L < ans) return;
  pair<lli, lli> left = {L, (L+R)/2}, right = {(L+R)/2+1, R};
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 30 / 30
• Subtask 2: 16.9083288594 / 70