P1007 single log bridge

Topic link ：

P1007 Single-plank bridge - Luogu | New ecology of computer science education (luogu.com.cn)

Topic ：

Title Description ：

Input description ： 

  Output description ：

Examples and explanations ： 

  Ideas ：

The minimum time is the maximum of the minimum value of each person to both ends

The collision problem needs to be considered in the maximum time , But the collision problem is considered on the basis of different people , The position of two people colliding and penetrating the past two points is the same , So it's equivalent to the maximum value of the maximum value of everyone at both ends

#include<bits/stdc++.h>
using namespace std;

int arr[5005];

int main(){
	int n;
	cin >> n;
	int m;
	cin >> m;
	int maxn = 0;
	int minn = 0;
	for(int i = 0; i < m; i++){
		cin >> arr[i];
		maxn = max(maxn, min(arr[i], n + 1 - arr[i]));
		minn = max(minn, max(arr[i], n + 1 - arr[i]));
	}
	cout << maxn << " " << minn << endl;;
	return 0;
}