【NOIP考前题目回顾】Luogu P1005

思路

很考思维的一道题，但是模拟一下的话就没什么难度了。首先两个人相遇并立即掉头走，那么将这两个人互换一下的话就会发现他们掉头走并没有什么卵用，人还是那几个人。所以直接放代码。

代码

#include <algorithm>#include <cctype>#include <climits>#include <cmath>#include <cstdio>#include <cstdlib>#include <cstring>#include <iostream>#include <queue>#include <utility>int nextInt(){    int num = 0;    char c;    bool flag = false;    while ((c = std::getchar()) == ' ' || c == '\r' || c == '\t' || c == '\n');    if (c == '-')        flag = true;    else        num = c - 48;    while (std::isdigit(c = std::getchar()))        num = num * 10 + c - 48;    return (flag ? -1 : 1) * num;}int main(){    int n, l, p, maxv = 0, minv = 0;    l = nextInt();    n = nextInt();    for (int i = 1; i <= n; i++)    {        p = nextInt();        maxv = max(maxv, max(l - p + 1, p));        minv = max(minv, min(l - p + 1, p));    }    std::cout << minv << ' ' << maxv << std::endl;#ifdef __EDWARD_EDIT    std::cin.get();    std::cin.get();#endif    return 0;}