Submission #1352701

---

Source Code Expand

#include <vector>
#include <iostream>
#include <utility>
#include <algorithm>
#include <string>
#include <deque>
#include <queue>
#include <tuple>
#include <queue>
#include <functional>
#include <cmath>
#include <iomanip>
#include <map>
#include <set>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <complex>
#include <iterator>
#include <array>
#include <memory>
#include <stack>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
#define ld long double
#define INF 1e9
#define EPS 0.0000000001
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,s,n) for(int i=s;i<n;i++)
#define all(in) in.begin(), in.end()
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }
#define MAX 9999999
using namespace std;
typedef pair<int, int> pii;
typedef pair<double,double>pdd;
typedef pair<ll,ll>pll;
int main(){
    int n;
    cin>>n;
    vector<int>v(n);rep(i,n)cin>>v[i];
    vector<int>dp(n,0);
    int flag = 0;
    int cnt=1;
    rep(i,n-1){
        if(!i||flag==2){if(v[i]<v[i+1])flag=1;else if(v[i]!=v[i+1])flag=0;else flag=2;}
        if(flag==1){
            if(v[i]<v[i+1])continue;
            else{
                if(v[i]==v[i+1])flag=2;
                else{
                    flag=0;
                    i+=1;
                    if(i==n-1)cnt++;
                    cnt++;
                }
            }
        }else{
            if(v[i]>v[i+1])continue;
            if(v[i]==v[i+1])flag=2;
            else{
                flag=1;
                i+=1;
                if(i==n-1)cnt++;
                cnt++;
            }
        }
    }
    cout<<cnt<<endl;
}

Submission Info

Judge Result