D. Let‘s Go Hiking （思维，博弈）

On a weekend, Qingshan suggests that she and her friend Daniel go hiking. Unfortunately, they are busy high school students, so they can only go hiking on scratch paper.

A permutation p is written from left to right on the paper. First Qingshan chooses an integer index x (1≤x≤n) and tells it to Daniel. After that, Daniel chooses another integer index y (1≤y≤n, y≠x).

The game progresses turn by turn and as usual, Qingshan moves first. The rules follow:

If it is Qingshan’s turn, Qingshan must change x to such an index x′ that 1≤x′≤n, |x′−x|=1, x′≠y, and px′<px at the same time.
If it is Daniel’s turn, Daniel must change y to such an index y′ that 1≤y′≤n, |y′−y|=1, y′≠x, and py′>py at the same time.
The person who can’t make her or his move loses, and the other wins. You, as Qingshan’s fan, are asked to calculate the number of possible x to make Qingshan win in the case both players play optimally.

Input
The first line contains a single integer n (2≤n≤105) — the length of the permutation.

The second line contains n distinct integers p1,p2,…,pn (1≤pi≤n) — the permutation.

Output
Print the number of possible values of x that Qingshan can choose to make her win.

Examples
inputCopy
5
1 2 5 4 3
outputCopy
1
inputCopy
7
1 2 4 6 5 3 7
outputCopy
0
Note
In the first test case, Qingshan can only choose x=3 to win, so the answer is 1.

In the second test case, if Qingshan will choose x=4, Daniel can choose y=1. In the first turn (Qingshan’s) Qingshan chooses x′=3 and changes x to 3. In the second turn (Daniel’s) Daniel chooses y′=2 and changes y to 2. Qingshan can’t choose x′=2 because y=2 at this time. Then Qingshan loses.

#include <bits/stdc++.h>
#define inf 0x3f3f3f3f
using namespace std;
typedef long long LL;
const int N = 1e5 + 10;
int n, a[N];
set<int> s;                                                   //纪录谷峰
int main() {
    ios::sync_with_stdio(false);
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    int flag = 1, cnt = 2, m = 0;
    if (a[2] <= a[1]) flag = 0;
    for (int i = 3; i <= n + 1; i++) {
        if (flag == 0) {
            if (a[i] < a[i - 1] && i != n + 1)
                cnt++;
            else {
                if (m < cnt) {
                    s.clear();
                    s.insert(i - cnt);
                    m = cnt;

                } else if (m == cnt) {
                    s.insert(i - cnt);
                }
                cnt = 2;
                flag = 1;
            }
        } else {
            if (a[i] > a[i - 1] && i != n + 1)
                cnt++;
            else {
                if (m < cnt) {
                    s.clear();
                    s.insert(i - 1);
                    m = cnt;
                } else if (m == cnt) {
                    s.insert(i - 1);
                }
                cnt = 2;
                flag = 0;
            }
        }
    }
    if (s.size() != 1)
        cout << "0\n";
    else {
        int cnt1 = 1, cnt2 = 1;
        int c = *s.begin();
        for (int i = c - 1; i >= 1; i--) {
            if (a[i] < a[i + 1])
                cnt1++;
            else
                break;
        }
        for (int i = c + 1; i <= n; i++) {
            if (a[i] < a[i - 1])
                cnt2++;
            else
                break;
        }
        if (cnt1 < cnt2) swap(cnt1, cnt2);
        if (cnt1 >= cnt2 + 1 || cnt1 % 2 == 0)
            cout << "0\n";
        else
            cout << "1\n";
    }
    return 0;
}