#include <bits/stdc++.h>
typedef long long int lli;
using namespace std;
const int INF = 1e9 + 3;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector <int> a(n);
for (int i = 0; i < n; i++){
cin >> a[i];
}
int ans = INF, prev, here;
for (int rep = 0; rep <= 1; rep++){
prev = a[0], here = 0;
for (int i = 1; i < n; i++){
if (i % 2 == rep){
if (prev <= a[i]){
here++;
prev = -INF;
}
else{
prev = a[i];
}
}
else{
if (prev >= a[i]){
here++;
prev = INF;
}
else{
prev = a[i];
}
}
}
ans = min(ans, here);
}
cout << ans << "\n";
return 0;
}
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> typedef long long int lli; using namespace std; const int INF = 1e9 + 3; int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; vector <int> a(n); for (int i = 0; i < n; i++){ cin >> a[i]; } int ans = INF, prev, here; for (int rep = 0; rep <= 1; rep++){ prev = a[0], here = 0; for (int i = 1; i < n; i++){ if (i % 2 == rep){ if (prev <= a[i]){ here++; prev = -INF; } else{ prev = a[i]; } } else{ if (prev >= a[i]){ here++; prev = INF; } else{ prev = a[i]; } } } ans = min(ans, here); } cout << ans << "\n"; return 0; } |
English