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
#include <iostream> 
#include <vector>
using namespace std;
int main()
{
	cin.tie(0);
	cout.tie(0);
	ios_base::sync_with_stdio(0);

	int n, a, b;
	cin >> n;

	vector <int> vectorek(n);

	for (int i = 0; i < n; i++)
	{
		int t;
		cin >> t;
		vectorek[i] = t;
	}

	int index;

	int wynik = 0;
	int i = 1;

	while (i < n) {

		int l = vectorek[i - 1];
		int x = vectorek[i];
		int r = (i + 1 < n) ? n + 1 : l;

		if (x < l && x < r)
		{
			i += 2;
		}

		else
		{
			vectorek[i] = min(l, r) - 1;
			wynik++;
			i += 2;
		}
	}

	cout << wynik;

}