#include <bits/stdc++.h> using namespace std; const int MAX_N = 5e5+7; int n, c, b, tab[MAX_N]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin>>n; for (int i = 0; i < n; i++) { cin>>tab[i]; } for (int i = 1; i < n; i++) { if (i%2==1) { if (tab[i-1]<=tab[i]) { b++; i++; } } else { if (tab[i-1]>=tab[i]) { b++; i++; } } } for (int i = 1; i < n; i++) { if (i%2==0) { if (tab[i-1]<=tab[i]) { c++; i++; } } else { if (tab[i-1]>=tab[i]) { c++; i++; } } } //cout<<b<<" "<<c; cout<<min(b, c); }
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 | #include <bits/stdc++.h> using namespace std; const int MAX_N = 5e5+7; int n, c, b, tab[MAX_N]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin>>n; for (int i = 0; i < n; i++) { cin>>tab[i]; } for (int i = 1; i < n; i++) { if (i%2==1) { if (tab[i-1]<=tab[i]) { b++; i++; } } else { if (tab[i-1]>=tab[i]) { b++; i++; } } } for (int i = 1; i < n; i++) { if (i%2==0) { if (tab[i-1]<=tab[i]) { c++; i++; } } else { if (tab[i-1]>=tab[i]) { c++; i++; } } } //cout<<b<<" "<<c; cout<<min(b, c); } |