제출 #125823

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
125823	2019-07-06 12:11:05	dragoon	Gap (APIO16_gap)	C++14	100 / 100	83 ms	5252 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 <vector>
#include <algorithm>
using namespace std;
typedef long long LL;
LL Solve1(int N) {
  vector<LL> V(N, 0);
  LL a = 0, b = 1000000000000000000LL;
  a--, b++;
  for (int i = 0, j = N - 1; i <= j; i++, j--) {
    LL c, d;
    MinMax(a, b, &c, &d);
    V[i] = c;
    V[j] = d;
    a = c + 1;
    b = d - 1;
  }
  LL ans = 0;
  for (int i = 0; i < N - 1; i++) ans = max(ans, V[i + 1] - V[i]);
  return ans;
}
LL Solve2(int N) {
  vector<LL> V;
  LL a = 0, b = 1000000000000000000LL;
  a--, b++;
  {
    LL c, d;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

컴파일 시 표준 에러 (stderr) 메시지

gap.cpp: In function 'LL Solve2(int)':
gap.cpp:46:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 1; i < V.size(); i++) ans = max(ans, V[i] - V[i - 1]);
                  ~~^~~~~~~~~~

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