[noip2013]花匠 题解

#include<bits/stdc++.h>
using namespace std;
int last,now,tmp;
int n,cnt;
int main()
{
scanf("%d",&n);
scanf("%d",&last);
for(int i=2;i<=n;i++)
{
scanf("%d",&now);
if(now-last)
if(tmp==0||(now<last&&tmp>0)||(now>last&&tmp<0))
cnt++,tmp=now-last;
last=now;
}
cout<<++cnt;
return 0;
}