Submission #1305607

---

Source Code Expand

#include "bits/stdc++.h"
#define _CRT_SECURE_NO_WARNINGS
#define rep(i,n) for(int i = 0;i < n;i++)
#define REP(i,n,k) for(int i = n;i < k;i++)
#define P(p) cout << (p) << endl;
#define sP(p) cout << setprecision(15) << fixed << p << endl;
#define vi vector<int>
#define printv(v) for(int i = 0;i < v.size();i++)P(v[i]);
#define printt(a,b) cout << a << " " << b << endl; 
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int dx[] = { 1, -1 , 0 , 0};
int dy[] = { 0,  0,  1, -1};
int MOD = 1e9 + 7;

void solve() {
  int n,ans = 0;
  cin >> n;
  vector<int> A(n);
  for(int i = 0;i < n;i++){
    cin >> A[i];
  }
  for(int i = 0;i < n;i++){
    if(i == n-1){
      ans++;
      break;
    }
    if(A[i] < A[i+1]){
      ans++;
      while(A[i] < A[i+1]){
	i++;
      }
    }else if(A[i] >= A[i+1]){
      ans++;
      while(A[i] >= A[i+1]){
	i++;
      } 
    }
  }
  P(ans);
}

int main() {
  solve();
  return 0;
}

Submission Info

Judge Result