제출 #41260

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
41260	2018-02-15 08:06:20	Just_Solve_The_Problem	Gap (APIO16_gap)	C++11	88.08 / 100	83 ms	2284 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 <bits/stdc++.h> 
//#include "grader.cpp"
#define ll long long
const int inf = (int)1e9 + 7;
using namespace std;
ll solve1(int n) {
  long long left;
  long long right;
  left = 0;
  right = 1e18;
  long long mn = 0, mx = 1e18;        
  long long vec[n];
  int cnt = 0;
  int cn = n - 1;
  while (cnt <= cn) {
    MinMax(left, right, &mn, &mx);
    vec[cnt++] = mn; 
    if (mn != mx)
      vec[cn--] = mx;
    left = mn + 1;
    right = mx - 1; 
  }                  
  long long ans = 0;
  for (int i = 1; i < n; i++) {         
    if (vec[i] - vec[i - 1] > ans) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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