제출 #45275

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
45275	2018-04-12 12:49:15	nibnalin	Gap (APIO16_gap)	C++17	30 / 100	96 ms	2176 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 = lli(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 sub2(lli n)
{
  pair<lli, lli> range;
  MinMax(0, inf, &range.first, &range.second);
  lli sz = (range.second-range.first-1)/(n-2);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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