제출 #42622

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
42622		MatheusLealV	Gap (APIO16_gap)	C++14	컴파일 에러	0 ms	0 KiB

gap

#include <bits/stdc++.h>
#include "gap.h"
#define N 100005
using namespace std;
typedef long long ll;
 
ll n, v[N], ans[N];
 
ll findGap(int T, int N_)
{
	n = N_;
 
	ll esq = 0, dir = 2000000000000000000LL, best = 0;
 
	for(int i = 1, st = 1, en = n; i <= (n + 1)/2; i++, st ++, en --)
	{
		ll a, b;
 
		MinMax(esq, dir, a, b);
 
		esq = a + 1, dir = b - 1;
 
		ans[st] = a, ans[en] = b;
	}
 
	for(int i = 1; i <= n; i++) best = max(best, ans[i] - ans[i - 1]);
 
	return best;
}

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

gap.cpp: In function 'll findGap(int, int)':
gap.cpp:19:24: error: invalid conversion from 'll {aka long long int}' to 'long long int*' [-fpermissive]
   MinMax(esq, dir, a, b);
                        ^
In file included from gap.cpp:2:0:
gap.h:1:6: note:   initializing argument 3 of 'void MinMax(long long int, long long int, long long int*, long long int*)'
 void MinMax(long long, long long, long long*, long long*);
      ^
gap.cpp:19:24: error: invalid conversion from 'll {aka long long int}' to 'long long int*' [-fpermissive]
   MinMax(esq, dir, a, b);
                        ^
In file included from gap.cpp:2:0:
gap.h:1:6: note:   initializing argument 4 of 'void MinMax(long long int, long long int, long long int*, long long int*)'
 void MinMax(long long, long long, long long*, long long*);
      ^