巨佬帮帮蒟蒻吧
查看原帖
巨佬帮帮蒟蒻吧
230875
Surge_of_Force楼主2021/2/7 21:11
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int main()
{
	int l,n,p,maxx=-1,minn=1e7;
	cin>>l>>n;
	if(n==0||l==0)
	{
		cout<<0<<" "<<0;
		return 0;
	}
	for(int i=1;i<=n;i++)
	{
		cin>>p;
		maxx=max(maxx,max(p,l-p+1));
		minn=min(minn,min(p,l-p+1));
	}
	cout<<minn<<" "<<maxx;
	return 0;
}
2021/2/7 21:11
加载中...