Advertisement
Guest User

Untitled

a guest
Apr 28th, 2017
58
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.16 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. #define f first
  3. #define s second
  4. #define mp make_pair
  5. #define pb push_back
  6. #define lp(i,a,n) for(int i=(a);i<=(int)(n);++i)
  7. #define lpd(i,a,n) for(int i=(a);i>=(int)(n);--i)
  8. #define mem(a,b) memset(a,b,sizeof a)
  9. #define all(v) v.begin(),v.end()
  10. #define println(a) cout <<(a) <<endl
  11. #define sz(x) ((int)(x).size())
  12. #define readi(x) scanf("%d",&x)
  13. #define read2i(x,y) scanf("%d%d",&x,&y)
  14. #define read3i(x,y,z) scanf("%d%d%d",&x,&y,&z)
  15. #define readll(x) scanf("%I64d",&x)
  16. #define mod 1000000007
  17. #define eps 1e-6
  18. #define infi 1000000000
  19. #define infll 1000000000000000000ll
  20. using namespace std;
  21. typedef long long ll;
  22. typedef pair<int, int> pii;
  23. typedef pair<ll, ll> pll;
  24. typedef vector<int> vi;
  25. typedef vector<vi> vvi;
  26. typedef vector<ll> vll;
  27. typedef set<int> si;
  28. typedef map<int,int> mii;
  29.  
  30. const int N = 100002;
  31. int n,a[N];
  32.  
  33. int main(){
  34. readi(n);
  35. lp(i,1,n) readi(a[i]);
  36. int ans = 0;
  37. lp(i,1,n-2) ans += (a[i] < a[i+1] and a[i+1] < a[i+2]) or (a[i] > a[i+1] and a[i+1] > a[i+2]);
  38. cout <<ans;
  39. }
  40.  
  41. //freopen("input.txt","r",stdin);
  42. //freopen("output.txt","w",stdout);
  43. //ios::sync_with_stdio(0);cin.tie(0);
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement