Submission #1221807

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <cstring>
#include <set>
#include <map>
#include <stack>
#include <queue>
using namespace std;

#define fast ios::sync_with_stdio(false);cin.tie(0); cout.tie(0);
#define sz(s) (int)s.size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i,n) for(int i=0;i<(int)n;i++)
#define for1(i,n) for(int i=1;i<=(int)n;i++)

typedef long long ll;
const int N = (int)1e6+7;

int main(){
    fast;
    int n,a[N],ans=0;
    cin>>n;
    forn(i,n) cin>>a[i];
    
    int x=-1;
    for(int i=0;i<n-1;i++){
        if(a[i]==a[i+1]) continue;
        
        if(x==-1){
            if(a[i+1]>a[i]) x=0;
            else x=1;
            continue;
        }
        
        if(x==0 and a[i+1]>a[i]) continue;
        if(x==1 and a[i+1]<a[i]) continue;
        
        if(a[i+1]>a[i]){
            if(x==1){
                ans++;
            }
            i++;
            if(a[i+1]>a[i])
                x=0;
            else if(a[i+1]<a[i])
                x=1;
            else x=-1;
        }else{
            if(x==0){
                ans++;
            }
            i++;
            if(a[i+1]>a[i])
                x=0;
            else if(a[i+1]<a[i])
                x=1;
            else x=-1;
        }
        //cout<<i<<" "<<ans<<endl;
    }
    ans++;
    cout<<ans<<endl;
    return 0;
}

Submission Info

Judge Result