1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
#include <algorithm>
#include <cstdio>
#include <vector>
#include <set>

using namespace std;

long a[121];

int main()
{
	long max = 1000000, min = -1000000;
	long n, l, prev = max + 1, prevRev = min - 1;
	long res = 0, resRev = 0;
	scanf("%ld", &n);
	for (long i = 0; i < n; ++i)
	{
		scanf("%ld", &l);
		if ((i & 1) == 0)
		{
			if (l >= prev)
			{
				prev = min;
				res++;
			}
			else
				prev = l;

			if (l <= prevRev)
			{
				prevRev = max;
				resRev++;
			}
			else
				prevRev = l;
		}
		else
		{
			if (l <= prev)
			{
				prev = max;
				res++;
			}
			else
				prev = l;

			if (l >= prevRev)
			{
				prevRev = min;
				resRev++;
			}
			else
				prevRev = l;
		}
	}

	printf("%ld", res < resRev ? res : resRev);
	return 0;
}