답안 #40760

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
40760	2018-02-08T05:10:59 Z	Just_Solve_The_Problem	Gap (APIO16_gap)	C++11	컴파일 오류	0 ms	0 KB

gap

#include <bits/stdc++.h>
#include <gap.h>
                               
long long findGap(int t, int n) {
		long long left;
		long long right;
		left = 1;
		right = 1e18;
		long long mn, mx;        
		long long vec[n];
		int cnt = 0;
		while (mn != mx) {
			MinMax(left, right, mn, mx);
			vec[cnt++] = mn; 
			if (mn != mx)
				vec[cnt++] = mx;
			left = mn + 1;
			right= mx - 1;	
		}
		sort(vec, vec + n);
		long long ans = 0;
		for (int i = 1; i < n; i++) {
			ans = max(ans, vec[i] - vec[i - 1]);
		}
		return ans;
}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:13:30: error: invalid conversion from 'long long int' to 'long long int*' [-fpermissive]
    MinMax(left, right, mn, mx);
                              ^
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:13:30: error: invalid conversion from 'long long int' to 'long long int*' [-fpermissive]
    MinMax(left, right, mn, mx);
                              ^
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*);
      ^
gap.cpp:20:20: error: 'sort' was not declared in this scope
   sort(vec, vec + n);
                    ^
gap.cpp:20:20: note: suggested alternative:
In file included from /usr/include/c++/5/algorithm:62:0,
                 from /usr/include/x86_64-linux-gnu/c++/5/bits/stdc++.h:64,
                 from gap.cpp:1:
/usr/include/c++/5/bits/stl_algo.h:4718:5: note:   'std::sort'
     sort(_RandomAccessIterator __first, _RandomAccessIterator __last,
     ^
gap.cpp:23:38: error: 'max' was not declared in this scope
    ans = max(ans, vec[i] - vec[i - 1]);
                                      ^
gap.cpp:23:38: note: suggested alternative:
In file included from /usr/include/c++/5/algorithm:62:0,
                 from /usr/include/x86_64-linux-gnu/c++/5/bits/stdc++.h:64,
                 from gap.cpp:1:
/usr/include/c++/5/bits/stl_algo.h:3463:5: note:   'std::max'
     max(initializer_list<_Tp> __l, _Compare __comp)
     ^