Files
ExerciseHub/Luogu/P1007 独木桥.cpp
2025-08-14 12:59:59 +08:00

26 lines
480 B
C++

#include <iostream>
#include <vector>
using namespace std;
int main(){
int length, n;
int tmp;
int js;
vector<int> ma, mi;
cin >> length >> n;
for(int i = 0;i < n; i++){
cin >> tmp;
js = max(length - tmp + 1, tmp);
ma.push_back(js);
js = min(length - tmp + 1, tmp);
mi.push_back(js);
}
int smax = 0;
int smax2 = 0;
for(int i = 0;i < n; i++){
if(ma.at(i) > smax) smax = ma[i];
if(mi[i] > smax2) smax2 = mi[i];
}
cout << smax2 << " " << smax;
return 0;
}