[Review] NOIP exam topics Luogu P1005

Thinking

It is a question of thinking test, but if nothing simulated about the degree of difficulty. First, two people meet and immediately turn away, then swap the two men look at, they would find that they turn around and go with no eggs, people are still a few people. So put the code directly.

Code

#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;
}