제출 #109303

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

gap

#include<iostream>
#include<algorithm>
#include<vector>
#include "gap.h"
using namespace std;
#define vel vector<long long>
#define rep(i,n) for(int i=0;i<n;i++)
int pr = 1000000007;
int ref(int &a) {
	a = a % pr;
	a += pr;
	a = a % pr;
	return a;
}
long long findGap(int t, int n) {
	long long a1; long long an;
	long long INF = pr - 7;
	INF *= INF;
	MinMax(0, INF, &a1, &an);
	long long X = an - a1+1;
	int now_min = a1;
	int ans = 0;
	rep(i, n) {
		int mn, mx;
		MinMax(a1 + (X*i) / n, a1 + (X*(i + 1)) / n, mn, mx);
		if (mn != -1) {
			ans = max(mn - now_min, ans);
			now_min = mx;
		}
	}
	return ans;
}

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

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:25:54: error: invalid conversion from 'int' to 'long long int*' [-fpermissive]
   MinMax(a1 + (X*i) / n, a1 + (X*(i + 1)) / n, mn, mx);
                                                      ^
In file included from gap.cpp:4: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:25:54: error: invalid conversion from 'int' to 'long long int*' [-fpermissive]
   MinMax(a1 + (X*i) / n, a1 + (X*(i + 1)) / n, mn, mx);
                                                      ^
In file included from gap.cpp:4: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*);
      ^~~~~~