Submission #1369600

---

Source Code Expand

#include <bits/stdc++.h>

#define fi first
#define se second
#define sc scanf
#define pr printf
#define pb push_back
#define ll long long
#define fin(s) freopen( s, "r", stdin );
#define fout(s) freopen( s, "w", stdout );

const long long N = 100100;
const long long MX = sqrt(N);
const long long H = 17;
const long long MAGIC = 1000;
const long long mod = 1e9 + 7;

using namespace std;

int n;
int a[N];

bool f(int a, int b, int c)
{
        return (a <= b && b <= c || a >= b && b >= c);
}

void solve()
{
        int cnt = 0;
        cin >> n;
        for(int i = 1; i <= n; i++){
                cin >> a[i];
        }
        for(int i = 3; i <= n; i++){
                if(!f(a[i - 2], a[i - 1], a[i])){
                        cnt++;
                        i += 1;
                }
        }
        cout << cnt + 1 << endl;
}

bool mtest = false; int main()
{
        //fin("input.txt");
        //fout("output.txt");
        //fin("landscape.in");
        //fout("landscape.out");
        ios_base::sync_with_stdio(0);
        int TE = 1;
        if(mtest)
                cin >> TE;
        while(TE--)
                solve();
        return 0;
}

Submission Info

Judge Result