Submission #1221191

---

Source Code Expand

#include <set>
#include <map>
#include <queue>
#include <ctime>
#include <cmath>
#include <cstdio>
#include <vector>
#include <string>
#include <cctype>
#include <bitset>
#include <cstring>
#include <cstdlib>
#include <utility>
#include <iostream>
#include <algorithm>
#define REP(i,a,b) for(int i=(a);i<=(b);i++)
#define PER(i,a,b) for(int i=(a);i>=(b);i--)
#define RVC(i,S) for(int i=0;i<(S).size();i++)
#define RAL(i,u) for(int i=fr[u];i!=-1;i=e[i].next)
using namespace std;
typedef long long LL;
typedef pair<int,int> pii;
     
template<class T> inline
void read(T& num) {
    bool start=false,neg=false;
    char c;
    num=0;
    while((c=getchar())!=EOF) {
        if(c=='-') start=neg=true;
        else if(c>='0' && c<='9') {
            start=true;
            num=num*10+c-'0';
        } else if(start) break;
    }
    if(neg) num=-num;
}
/*============ Header Template ============*/

const int maxn=(int)(1e5)+5;
int ai[maxn];

int main() {
    int n;
    read(n);
    REP(i,1,n) read(ai[i]);
    int sgn=0,cnt=0;
    REP(i,2,n) {
        if(ai[i]<ai[i-1]) {
            if(sgn==1) ++cnt,sgn=0; else sgn=-1;
        }
        if(ai[i]>ai[i-1]) {
            if(sgn==-1) ++cnt,sgn=0; else sgn=1;
        }
    } ++cnt;
    printf("%d\n",cnt);
    return 0;
}

Submission Info

Judge Result