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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
#include <iostream>
using namespace std;
int main(){
	int n,wynik,d=0,help;
	cin>>n;
	int mal[n];
	int wzr[n];
	for(int i=0; i<n; ++i){
		cin>>mal[i];
		wzr[i]=mal[i];
	}
	//help=tab[i+1];
	//maleje (i%2==0 => wzrasta)
	for(int i=1; i<n; ++i){
		if(i!=n-1){
			if(i%2==0){
				if(mal[i]<=mal[i-1]){
					d++;
					help=max(mal[i-1],mal[i+1]);
					mal[i]=help+1;
				}
			}
			else{
				if(mal[i]>=mal[i-1]){
					d++;
					help=min(mal[i-1],mal[i+1]);
					mal[i]=help-1;
				}
			}
		}
		else if(i==n-1){
			if(i%2==0){
				if(mal[i]<=mal[i-1]){
					d++;
					mal[i]=mal[i-1]+1;
				}
			}
			else{
				if(mal[i]>=mal[i-1]){
					d++;
					mal[i]=mal[i-1]-1;
				}
			}
		}
	}
	wynik=d;
	d=0;
	//wzrasta (i%2==0 => maleje)
	for(int i=1; i<n; ++i){
		if(i!=n-1){
			if(i%2==1){
				if(wzr[i]<=wzr[i-1]){
					d++;
					help=max(wzr[i-1],wzr[i+1]);
					wzr[i]=help+1;
				}
			}
			else{
				if(wzr[i]>=wzr[i-1]){
					d++;
					help=min(wzr[i-1],wzr[i+1]);
					wzr[i]=help-1;
				}
			}
		}
		else if(i==n-1){
			if(i%2==1){
				if(wzr[i]<=wzr[i-1]){
					d++;
					wzr[i]=wzr[i-1]+1;
				}
			}
			else{
				if(wzr[i]>=wzr[i-1]){
					d++;
					wzr[i]=wzr[i-1]-1;
				}
			}
		}
	}
	wynik=min(wynik,d);
	cout<<wynik;
}