Submission #1221346

---

Source Code Expand

/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author yassin
 */

#include <fstream>

#include <iostream>
#include <vector>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
#include <cstdlib>
#include <tuple>
#include <queue>
#include <functional>
#include <stack>
#include <numeric>
#include <cassert>

using namespace std;

class AGC_A {
public:
    void solve(istream& in, ostream& out) {
        int N;
        in >> N;
        vector<int> A(N);
        for (int i = 0; i < N; ++i) {
            in >> A[i];
        }
        
        int res = 1;
        for (int i = 1; i + 1 < N; ++i) {
            if ((A[i] < A[i-1] && A[i] < A[i+1]) || (A[i] > A[i-1] && A[i] > A[i+1])) {
                ++res;
                ++i;
            }
        }
        int res2 = 2;
        for (int i = 3; i + 1 < N; ++i) {
            if ((A[i] < A[i-1] && A[i] < A[i+1]) || (A[i] > A[i-1] && A[i] > A[i+1])) {
                ++res2;
                ++i;
            }
        }
        int res3 = 2;
        for (int i = 2; i + 2 < N; ++i) {
            if ((A[i] < A[i-1] && A[i] < A[i+1]) || (A[i] > A[i-1] && A[i] > A[i+1])) {
                ++res3;
                ++i;
            }
        }
        //cout << res << " " << res2 << endl;
        out << min(res, min(res2, res3)) << "\n";
    }
};


int main() {
	std::ios::sync_with_stdio(false); cin.tie(nullptr);

	AGC_A solver;
	std::istream& in(std::cin);
	std::ostream& out(std::cout);
	solver.solve(in, out);
	return 0;
}

Submission Info

Judge Result