#include<bits/stdc++.h> using namespace std; int check1(vector<int> v) { int ans = 0; int n = v.size(); for(int i = 1; i < n; i++) { if(i % 2 && v[i] <= v[i-1]) { v[i] = 1e9; ans++; } else if(i % 2 == 0 && v[i] >= v[i -1]) { v[i] = -1e9; ans++; } } return ans; } int check2(vector<int> v) { int ans = 0; int n = v.size(); for(int i = 1; i < n; i++) { if(i % 2 == 0 && v[i] <= v[i-1]) { v[i] = 1e9; ans++; } else if(i % 2 && v[i] >= v[i -1]) { v[i] = -1e9; ans++; } } return ans; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector<int> v(n); for(int i = 0; i < n; i++) cin >> v[i]; int ans = min(check1(v), check2(v)); cout << ans << '\n'; }
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 | #include<bits/stdc++.h> using namespace std; int check1(vector<int> v) { int ans = 0; int n = v.size(); for(int i = 1; i < n; i++) { if(i % 2 && v[i] <= v[i-1]) { v[i] = 1e9; ans++; } else if(i % 2 == 0 && v[i] >= v[i -1]) { v[i] = -1e9; ans++; } } return ans; } int check2(vector<int> v) { int ans = 0; int n = v.size(); for(int i = 1; i < n; i++) { if(i % 2 == 0 && v[i] <= v[i-1]) { v[i] = 1e9; ans++; } else if(i % 2 && v[i] >= v[i -1]) { v[i] = -1e9; ans++; } } return ans; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector<int> v(n); for(int i = 0; i < n; i++) cin >> v[i]; int ans = min(check1(v), check2(v)); cout << ans << '\n'; } |