Submission #336867

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
336867	2020-12-17 05:45:38	seedkin	Gap (APIO16_gap)	C11	100 / 100	67 ms	2064 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 "gap.h"
#include <stdio.h>
long long arr[100001];
long long findGap(int T, int N)
{
  if(T == 1) {
    long long min = 0;
    long long max = 1e18;
    int minIdx = 0;
    int maxIdx = N-1;
    int maxIter = (N+1)/2;
    long long low;
    long long high;
    for(int i = 0; i < maxIter; i++) {
      MinMax(min, max, &low, &high);
      arr[minIdx++] = low;
      arr[maxIdx--] = high;
      min = low+1;
      max = high-1;
    }
    long long result = 0;
    for(int i =0; i < N-1; i++) {
      if(arr[i+1] - arr[i] > result ) result = arr[i+1] - arr[i];
    }
    // for(int i =0 ; i< N ; i++) {
    //  printf("%lld ", arr[i]);
    // }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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