Submission #6189871

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
inline void rd(int &x){
  int k, m=0;
  x=0;
  for(;;){
    k = getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
inline void wt_L(char a){
  putchar_unlocked(a);
}
inline void wt_L(int x){
  char f[10];
  int m=0, s=0;
  if(x<0){
    m=1;
    x=-x;
  }
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  if(m){
    putchar_unlocked('-');
  }
  while(s--){
    putchar_unlocked(f[s]+'0');
  }
}
int N;
int P[20];
int main(){
  int i, res=0;
  rd(N);
  {
    int Lj4PdHRW;
    for(Lj4PdHRW=0;Lj4PdHRW<N;Lj4PdHRW++){
      rd(P[Lj4PdHRW]);
    }
  }
  for(i=1;i<N-1;i++){
    if(P[i-1] < P[i]  &&  P[i] < P[i+1]){
      res++;
    }
    if(P[i-1] > P[i]  &&  P[i] > P[i+1]){
      res++;
    }
  }
  wt_L(res);
  wt_L('\n');
  return 0;
}
// cLay varsion 20190630-1

// --- original code ---
// int N, P[20];
// {
//   int i, res = 0;
//   rd(N,P(N));
//   rep(i,1,N-1){
//     if(P[i-1] < P[i] < P[i+1]) res++;
//     if(P[i-1] > P[i] > P[i+1]) res++;
//   }
//   wt(res);
// }

Submission Info

Judge Result