Submission #1793414

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <ctime>
#include <list>
#include <numeric>
#include <utility>
#include <ctime>
#define INF 100000000
#define LINF 9000000000000000000
#define mod 1000000007
 
#define rep(i,n) for(int i=0;i<int(n);i++)
#define REP(i,a,b) for(int i=(a);i<int(b);i++)
#define all(x) (x).begin(),x.end()
#define pb push_back
#define mp make_pair
#define MOD(x) (x%(mod))
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> pi;
 
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
bool debug=false;

/*---------------------------------------------------*/

int n;
int a[100005];
int hoge[100005];

int main(){
  cin>>n;
  rep(i,n)cin>>a[i];

  REP(i,1,n){
    if(a[i]<a[i-1])hoge[i]=0;
    else if(a[i]>a[i-1])hoge[i]=1;
    else hoge[i]=2;
  }
  
  int ans=1;
  hoge[0]=hoge[1];
  int c=hoge[0];
  //rep(i,n)cout<<i<<": "<<hoge[i]<<endl;
  REP(i,0,n){
    if(hoge[i]==2)continue;
    if(hoge[i]!=c){
      ans++;
      i++;
      c=hoge[i];
    }
  }
  cout<<ans<<endl;
  return 0;
}

Submission Info

Judge Result