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
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
#include <vector>
#include <iostream>
#include <math.h>

using namespace std;
int main()
{
    //zliczanie niepoprawnie ułożonych elementów 
    
    //Zmienne
    int clip_length;
    vector <int> sounds;
    bool rosnacy;
    bool max_numbers = false;

    //Input
    cin >> clip_length;


    int input = 0;
    for (int i = 0; i < clip_length; i++)
    {
        cin >> input;
        sounds.push_back(input);
        if (input == -1000000000 || input == 1000000000)
        {
            max_numbers = true;
        }
    }

    //ALgorytm
    double counter_1 = 0;
    if (max_numbers == true)
    {
        double ujemny_length = 0;
        double dodatni_length = 0;
        double rowne_length = 0;
        for (int i = 1; i < clip_length; i++)
        {
            if (sounds.at(i) > sounds.at(i - 1))
            {
                dodatni_length++;

                if (ujemny_length > 1)
                {
                    counter_1 += ceil(ujemny_length / 2);
                }
                if (rowne_length > 1)
                {
                    counter_1 += ceil(rowne_length / 2);
                }
                else if (rowne_length == 1)
                {
                    counter_1++;
                }
                rowne_length = 0;
                ujemny_length = 0;
            }
            else if (sounds.at(i) < sounds.at(i - 1))
            {
                ujemny_length++;
                if (dodatni_length > 1)
                {
                    counter_1 += ceil(ujemny_length / 2);
                }
                if (rowne_length > 1)
                {
                    counter_1 += ceil(rowne_length / 2);
                }
                else if (rowne_length == 1)
                {
                    counter_1++;
                }
                rowne_length = 0;
                dodatni_length = 0;
            }
            else {
                rowne_length++;
                if (ujemny_length > 1)
                {
                    counter_1 += ceil(ujemny_length / 2);
                }
                if (dodatni_length > 0)
                {
                    counter_1 += ceil(dodatni_length / 2);
                }
                dodatni_length = 0;
                ujemny_length = 0;
            }


        }
    }
    else {
        double ujemny_length = 0;
        double dodatni_length = 0;
        double rowne_length = 0;
        for (int i = 1; i < clip_length; i++)
        {
            if (sounds.at(i) > sounds.at(i-1))
            {
                dodatni_length++;
                
                if (ujemny_length > 1)
                {
                    counter_1 += ceil(ujemny_length / 2);
                }
                if (rowne_length > 1)
                {
                    counter_1 += ceil(rowne_length / 2);
                }
                else if (rowne_length == 1)
                {
                    counter_1++;
                }
                rowne_length = 0;
                ujemny_length = 0;
            }
            else if (sounds.at(i) < sounds.at(i - 1))
            {
                ujemny_length++;
                if (dodatni_length > 1)
                {
                    counter_1 += ceil(ujemny_length / 2);
                }
                if (rowne_length > 1)
                {
                    counter_1 += ceil(rowne_length / 2);
                }
                else if (rowne_length == 1)
                {
                    counter_1++;
                }
                rowne_length = 0;
                dodatni_length = 0;
            }
            else {
                rowne_length++;
                if (ujemny_length > 1)
                {
                    counter_1 += ceil(ujemny_length / 2);
                }
                if (dodatni_length > 0)
                {
                    counter_1 += ceil(dodatni_length / 2);
                }
                dodatni_length = 0;
                ujemny_length = 0;
            }


        }
    }
    
    //Output
    cout << counter_1;
}