#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int solve(int n, vector<int> a, bool inc) {
int last = a[0];
int score = 0;
for (int i = 1; i < n; i++) {
if (inc) {
if (a[i] > last) {
last = a[i];
}
else {
last = INF;
score++;
}
}
else {
if (a[i] < last) {
last = a[i];
}
else {
last = -INF;
score++;
}
}
inc = !inc;
}
return score;
}
int main() {
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
cout << min(solve(n, a, true), solve(n, a, false)) << 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 41 42 43 44 45 46 | #include <bits/stdc++.h> using namespace std; const int INF = 1e9; int solve(int n, vector<int> a, bool inc) { int last = a[0]; int score = 0; for (int i = 1; i < n; i++) { if (inc) { if (a[i] > last) { last = a[i]; } else { last = INF; score++; } } else { if (a[i] < last) { last = a[i]; } else { last = -INF; score++; } } inc = !inc; } return score; } int main() { ios_base::sync_with_stdio(false); int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } cout << min(solve(n, a, true), solve(n, a, false)) << endl; } |
English