[NOIP 2013]花匠 DP

代码

#include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;

int a[100005],ans(0),d;
int n;

int main(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
    }
    d=0;
    for(int i=1;i<n;i++){
        if(a[i+1]>a[i]&&d!=1) {
            ans++;
            d=1;
        }
        if(a[i+1]<a[i]&&d!=2) {
            ans++;
            d=2;
        }
    }
    printf("%d",ans+1);
    return 0;
}