【競プロ】p.24の例題【蟻本】

自分で解いたものメモ

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

int main() {
  int L, n;
  cin >> L >> n;
  vector<int> x(n);
  
  for (int i = 0; i < n; i++) {
    cin >> x.at(i);
  }
  
  //最小値
  int min_ans = 0;
  for (int i = 0; i < n; i++) {
    min_ans = max(min_ans, min(x.at(i), L-x.at(i)));
  }
  
  //最大値
  int max_ans = 0;
  for (int i = 0; i < n; i++) {
    max_ans = max(max_ans, max(x.at(i), L-x.at(i)));
  }
  
  cout << "min = " << min_ans << endl;
  cout << "max = " << max_ans << endl;
}

計算量はO(N)