Submission #1303663

---

Source Code Expand

#include<iostream>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

const int inf = 999999999;
const double pi = acos(-1);

#define rep(i,m,n) for(int i = (m); i < (int)(n); i++)
#define mod(i) ((i)%(ll)(1e9 + 7))
#define divm(a,b) (mod(a * modpow((ll)b,(ll)(1e9+5))))

ll modpow(ll i,ll j){ ll tmp=1; while(j){ if(j%2)tmp=mod(tmp*i);i=mod(i*i);j/=2;}return tmp;}

///////////////////////////////////////////////////////////////////////////


int main(){
	int n,a[100005] = {},ans = 0,t = 0;
    cin >> n;
    
    rep(i,0,n)cin >> a[i];

    rep(i,1,n){

        if(t > 0){
            if(a[i] - a[i-1] < 0){
                ans ++;
                t = 0;
            }
        }else if(t < 0){
            if(a[i] - a[i-1] > 0){
                ans ++;
                t = 0;
            }
        }else{
            if(a[i] - a[i-1] > 0)t = 1;
            else if(a[i] - a[i-1] < 0)t = -1;
            else t = 0;
        }
    }
    cout << ans +1<< endl;
	return 0;
}

Submission Info

Judge Result