#include <bits/stdc++.h> using namespace std; constexpr int INF = 1000000000; constexpr int MINF = - INF; int f(vector<int> const& a, bool bigger, int previ) { int r = 0; for (int i : a) { if (bigger) { if (previ >= i) { ++r; previ = INF; } else { previ = i; } } else { if (previ <= i){ ++r; previ = MINF; } else { previ = i; } } bigger = not bigger; } return r; } int solve() { int n; cin >> n; vector<int> a(n); for (int &i : a) cin >> i; return min(f(a, true, MINF), f(a, false, INF)); } int main() { ios_base::sync_with_stdio(false), cin.tie(nullptr); cout << solve() << '\n'; return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 | #include <bits/stdc++.h> using namespace std; constexpr int INF = 1000000000; constexpr int MINF = - INF; int f(vector<int> const& a, bool bigger, int previ) { int r = 0; for (int i : a) { if (bigger) { if (previ >= i) { ++r; previ = INF; } else { previ = i; } } else { if (previ <= i){ ++r; previ = MINF; } else { previ = i; } } bigger = not bigger; } return r; } int solve() { int n; cin >> n; vector<int> a(n); for (int &i : a) cin >> i; return min(f(a, true, MINF), f(a, false, INF)); } int main() { ios_base::sync_with_stdio(false), cin.tie(nullptr); cout << solve() << '\n'; return 0; } |