luogu P1970 花匠

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/qq_42369449/article/details/82948833

算法：贪心+模拟

难度：NOIP

题解：略

代码如下：

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <iostream>
#include <cmath>
#include <cstdlib>
#include <queue>
#define ll long long
#define N 100005
using namespace std;
int n,cnt,cot,ans=1;
int a[N];
int main()
{
    scanf("%d",&n);
    scanf("%d",&a[1]);
    for(int i = 2;i <= n;i++)
    {
        scanf("%d",&a[i]);
        if(a[i]==a[i-1]) continue;
        if(a[i]>a[i-1])
        {
            if(cot) cot=0,ans++;
            cnt=1;
        }else
        {
            if(cnt) cnt=0,ans++;
            cot=1;
        }
    }
    printf("%d\n",ans+1);
    return 0 ;
}