Submission #1222516

---

Source Code Expand

#include<queue>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#define ll long long
#define mod 1000000007
using namespace std;
int read()
{
    int x=0,f=1;
    char ch=getchar();
    while(ch<'0'||ch>'9')
    {
        if(ch=='-')f=-1;
        ch=getchar();
    }
    while(ch>='0'&&ch<='9')
    {
        x=x*10+ch-'0';
        ch=getchar();
    }
    return x*f;
}
const int N=1e5+10;
const int M=1e7+10;
int a[N];
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        int ans=1,x,pre,flag=-1;
        for(int i=0; i<n; i++)
        {
            x=read();
            if(i>0){
                if(flag==-1){
                    if(x>pre) flag=0;
                    else if(x<pre) flag=1;
                }
                else{
                    if(x>pre&&flag==1){
                        ans++;
                        flag=-1;
                    }
                    if(x<pre&&flag==0){
                        ans++;
                        flag=-1;
                    }
                }
            }
            pre=x;
        }
        printf("%d\n",ans);
    }
    return 0;
}

Submission Info

Judge Result