Zigzag

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
	cin.sync_with_stdio(false);	
	
    int n;
    cin>>n;
    
    int v[n];
    for (int i = 0; i < n; i++) cin>>v[i];
    
    if (n==1){cout<<1<<endl;return 0;}
    if (n==2){cout<<(v[0]!=v[1]?2:1)<<endl;return 0;}
    
    char m=v[0]<v[1]?1:v[0]>v[1]?-1:0;
    int t=m!=0?2:1;
    for (int i = 2; i < n; i++)
    {
        char m2=v[i]>v[i-1]?1:v[i]<v[i-1]?-1:0;
        if(m2!=m&&m2!=0){
            t++;
            m=m2;
        }
    }
    cout<<t<<endl;
    

	return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED