Submission #1222176

---

Source Code Expand

#ifdef __APPLE__
#include <cassert>
#include <iostream>
#include <iomanip>
#include <ctime>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <stack>
#include <string>
#include <cstring>
#include <sstream>
#include <map>
#include <set>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <cctype>
#include <list>
#include <cmath>
#include <limits>
#include <bitset>
#include <numeric>
#include <climits>
#include <complex>
#else
#include<bits/stdc++.h>
#endif // __APPLE__
using namespace std;
typedef pair<int,int>   II;
typedef vector<II>     VII;
typedef vector<int>     VI;
typedef vector< VI > 	VVI;
typedef long long int LL;
typedef  unsigned long long int ULL;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define SZ(a) (int)(a.size())
#define SET(a,b) memset(a,b,sizeof(a))
#define LET(x,a) __typeof(a) x(a)
#define ALL(c) (c).begin(),(c).end()
#define si(n) scanf("%d",&n)
#define dout(n) printf("%d\n",n)
#define sll(n) scanf("%lld",&n)
#define lldout(n) printf("%lld\n",n)
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL)
#define REP(i,a,b) for(int i = (int)a; i < (int)b; i++)
#define ROUNDOFFINT(d) d = (int)((double)d + 0.5)
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1)	{
cerr << name << " : " << arg1 << std::endl;}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
     const char* comma = strchr(names + 1, ',');cerr.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);}
#else
#define trace(...)
#endif
//A



int func1(int n, vector<int> &v)
{
    int i=0;
    
    int ans=0;
    for(;i<n;i++)
    {
        //trace(i);
        if (v[i]==v[i+1])
        {
            while(i+1<n && v[i]==v[i+1])
                i++;
            if(i==(n-1))
                ans++;
            else
                i--;
            continue;
        }
        if(v[i]<=v[i+1])
        {
            while(i+1<n && v[i]<=v[i+1])
                i++;
        }
        else
        {
            while(i+1<n && v[i]>=v[i+1])
                i++;
        }
        //trace(i,ans);
        ans++;
    }
    return ans;
}



int main()
{
	//fr;fw;
	fast_io;
    
    int n;
    cin>>n;
    VI v(n);
    REP(i,0,n)
    {
        cin>>v[i];
    }
    
    int ans1=func1(n,v);
    cout<<ans1<<endl;


	return 0;
}

Submission Info

Judge Result