#include<bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector <int> a1(n); vector <int> a2(n); for(int i = 0; i < n; i++) { cin >> a1[i]; a2[i] = a1[i]; } int wyn1 = 0; int wyn2 = 0; for (int i = 0; i < n - 1; i++) { if (i % 2 == 0) { if(a1[i] >= a1[i+1]) { a1[i+1] = 1000000000; wyn1++; } } else { if(a1[i] <= a1[i+1]) { a1[i+1] = -1000000000; wyn1++; } } } for (int i = 0; i < n - 1; i++) { if (i % 2 == 1) { if(a2[i] >= a2[i+1]) { a2[i+1] = 1000000000; wyn2++; } } else { if(a2[i] <= a2[i+1]) { a2[i+1] = -1000000000; wyn2++; } } } cout << min(wyn1, wyn2); }
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 | #include<bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector <int> a1(n); vector <int> a2(n); for(int i = 0; i < n; i++) { cin >> a1[i]; a2[i] = a1[i]; } int wyn1 = 0; int wyn2 = 0; for (int i = 0; i < n - 1; i++) { if (i % 2 == 0) { if(a1[i] >= a1[i+1]) { a1[i+1] = 1000000000; wyn1++; } } else { if(a1[i] <= a1[i+1]) { a1[i+1] = -1000000000; wyn1++; } } } for (int i = 0; i < n - 1; i++) { if (i % 2 == 1) { if(a2[i] >= a2[i+1]) { a2[i+1] = 1000000000; wyn2++; } } else { if(a2[i] <= a2[i+1]) { a2[i+1] = -1000000000; wyn2++; } } } cout << min(wyn1, wyn2); } |