// clang-format off #include <bits/stdc++.h> using namespace std; #define ALL(x) (x).begin(), (x).end() template<class C> void mini(C &a5, C b5) { a5 = min(a5, b5); } template<class C> void maxi(C &a5, C b5) { a5 = max(a5, b5); } #ifdef LOCAL const bool debug = true; #else const bool debug = false; #define cerr if (true) {} else cout #endif // clang-format on // #define int long long #define double long double const int INF = 1e9; const int mod = 1e9 + 7; int solve(vector<int> v) { int res = 0; for (int i = 0; i+1 < (int)v.size(); i++) { if (i % 2 == 0) { // i: P if (v[i] >= v[i+1]) { v[i+1] = INF; res++; } } else { // i: N if (v[i] <= v[i+1]) { v[i+1] = -INF; res++; } } } return res; } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); vector<int> v; int n; cin >> n; for (int i = 0; i < n; i++) { int a; cin >> a; v.push_back(a); } int res = solve(v); v.insert(v.begin(), -INF); int res2 = solve(v); cerr << res << " " << res2 << endl; cout << min(res, res2) << "\n"; return 0; }/* 5 4 1 3 3 1 * 4 -1000000 -1000000 -1000000 -1000000 */
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 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 | // clang-format off #include <bits/stdc++.h> using namespace std; #define ALL(x) (x).begin(), (x).end() template<class C> void mini(C &a5, C b5) { a5 = min(a5, b5); } template<class C> void maxi(C &a5, C b5) { a5 = max(a5, b5); } #ifdef LOCAL const bool debug = true; #else const bool debug = false; #define cerr if (true) {} else cout #endif // clang-format on // #define int long long #define double long double const int INF = 1e9; const int mod = 1e9 + 7; int solve(vector<int> v) { int res = 0; for (int i = 0; i+1 < (int)v.size(); i++) { if (i % 2 == 0) { // i: P if (v[i] >= v[i+1]) { v[i+1] = INF; res++; } } else { // i: N if (v[i] <= v[i+1]) { v[i+1] = -INF; res++; } } } return res; } int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); vector<int> v; int n; cin >> n; for (int i = 0; i < n; i++) { int a; cin >> a; v.push_back(a); } int res = solve(v); v.insert(v.begin(), -INF); int res2 = solve(v); cerr << res << " " << res2 << endl; cout << min(res, res2) << "\n"; return 0; }/* 5 4 1 3 3 1 * 4 -1000000 -1000000 -1000000 -1000000 */ |