洛谷P1007 独木桥（C++）

还是模拟

#include <bits/stdc++.h>
using namespace std;
bool a[10005];
int main(){
    int l, n, maxx = -1, minn = -1;
    cin >> l >> n;
    if(n == 0){
        cout << "0 0";
        return 0;
    }
    for(int i = 0; i < n; i++){
        int pos;
        cin >> pos;
        a[pos] = true;
    }
    for(int i = 1; i <= l; i++){
        if(a[i]){
            maxx = max(maxx, max(l + 1 - i, i));
            minn = max(minn, min(l + 1 - i, i));
        }
    }
    cout << minn << " " << maxx; 
    return 0;
}