Submission #1221266

---

Source Code Expand

#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<cstdio>
#include<vector>
#include<cctype>
#include<cstdlib>
#include<cstring>
#include<utility>
#include<algorithm>

#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define For(i,x,y) for(int i=((int)x);i<=((int)y);i++)
#define Dep(i,y,x) for(int i=((int)y);i>=((int)x);i--)
#define Rep(i,x) for (int y,i=head[x];i;i=E[i].nxt)
using namespace std;

typedef long long ll;
typedef unsigned int uint;
typedef pair<int,int> pii;

int rd() {
	char c=getchar(); int t=0,f=1;
	while (!isdigit(c)) f=(c=='-')?-1:1,c=getchar();
	while (isdigit(c)) t=t*10+c-48,c=getchar(); return t*f;
}
void wt(int x) {
	if (x<0) putchar('-'),wt(-x);
	else { if (x>9) wt(x/10); putchar(x%10+48); }
}

const int N=100035;

int n,a[N],ans,lst,op;

int main() {
	n=rd(),lst=rd(),ans=1;
	For (i,2,n) {
		a[i]=rd();
		
		if (!op) {
			if (a[i]>lst) op=1;
			else if (a[i]<lst) op=-1;
		}
		else if ((op==1 && a[i]<lst) || (op==-1 && a[i]>lst))
			ans++,op=0;

		lst=a[i];
	}
	printf("%d\n",ans);
	return 0;
}

Submission Info

Judge Result