#include <iostream> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; int a[n], b[n]; int result1 = 0, result2 = 0; for (int i=0; i<n; i++) { cin >> a[i]; b[i] = a[i]; if (i <= 0) continue; if (a[i-1] <= a[i] && i%2 == 0) { a[i] = -1000*1000*1000; result1++; } if (a[i-1] >= a[i] && i%2 == 1) { a[i] = 1000*1000*1000; result1++; } if (b[i-1] <= b[i] && i%2 == 1) { b[i] = -1000*1000*1000; result2++; } if (b[i-1] >= b[i] && i%2 == 0) { b[i] = 1000*1000*1000; result2++; } } cout << min(result1,result2) << endl; }
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 | #include <iostream> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; int a[n], b[n]; int result1 = 0, result2 = 0; for (int i=0; i<n; i++) { cin >> a[i]; b[i] = a[i]; if (i <= 0) continue; if (a[i-1] <= a[i] && i%2 == 0) { a[i] = -1000*1000*1000; result1++; } if (a[i-1] >= a[i] && i%2 == 1) { a[i] = 1000*1000*1000; result1++; } if (b[i-1] <= b[i] && i%2 == 1) { b[i] = -1000*1000*1000; result2++; } if (b[i-1] >= b[i] && i%2 == 0) { b[i] = 1000*1000*1000; result2++; } } cout << min(result1,result2) << endl; } |