답안 #977835

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
977835 2024-05-08T11:42:10 Z Amaarsaa Gap (APIO16_gap) C++14
컴파일 오류
0 ms 0 KB
#include<bits/stdc++.h>
#include "gap.h"
using namespace std;
using ll =long long;
ll Sub1(ll N) {
	ll b[n + 2],ans, lo1, hi1, lo, hi, l, r;
	l = 1;
	r = n;
	lo = 0;
	hi = 1e18;
	while ( l < r) {
		MinMax(lo, hi, lo1, hi1);
		if (lo1 == -1) break;
		b[l] = lo1;
		b[r] = hi1;
		lo = lo1 + 1;
		hi = hi1 - 1;
		l ++;
		r --;
	}
	ans = 0;
	for (int i = 2; i <= n; i ++) {
		ans =max(ans, b[i] - b[i - 1]);
	}
	return ans;
}
ll Sub2(ll N) {
	return N;
}
long long findGap(int T, int N) {
	if ( T == 1) {
		return Sub1(N); 
	}
	else return Sub2(N);
}

Compilation message

gap.cpp: In function 'll Sub1(ll)':
gap.cpp:6:7: error: 'n' was not declared in this scope
    6 |  ll b[n + 2],ans, lo1, hi1, lo, hi, l, r;
      |       ^
gap.cpp:12:18: error: invalid conversion from 'll' {aka 'long long int'} to 'long long int*' [-fpermissive]
   12 |   MinMax(lo, hi, lo1, hi1);
      |                  ^~~
      |                  |
      |                  ll {aka long long int}
In file included from gap.cpp:2:
gap.h:1:35: note:   initializing argument 3 of 'void MinMax(long long int, long long int, long long int*, long long int*)'
    1 | void MinMax(long long, long long, long long*, long long*);
      |                                   ^~~~~~~~~~
gap.cpp:12:23: error: invalid conversion from 'll' {aka 'long long int'} to 'long long int*' [-fpermissive]
   12 |   MinMax(lo, hi, lo1, hi1);
      |                       ^~~
      |                       |
      |                       ll {aka long long int}
In file included from gap.cpp:2:
gap.h:1:47: note:   initializing argument 4 of 'void MinMax(long long int, long long int, long long int*, long long int*)'
    1 | void MinMax(long long, long long, long long*, long long*);
      |                                               ^~~~~~~~~~
gap.cpp:14:3: error: 'b' was not declared in this scope
   14 |   b[l] = lo1;
      |   ^
gap.cpp:23:17: error: 'b' was not declared in this scope
   23 |   ans =max(ans, b[i] - b[i - 1]);
      |                 ^