#include<bits/stdc++.h> using namespace std; int tab[100009], tac[100009]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, a, wyn = 1e9; cin>>n; for(int i=1; i<=n; i++) cin>>tab[i]; for(int i=1; i<=n; i++) tac[i] = tab[i]; a = 0; for(int i=2; i<=n; i++) { if(i % 2 == 0 && tac[i] <= tac[i-1]) { tac[i] = 1e9; a++; } else if(i % 2 == 1 && tac[i] >= tac[i-1]) { tac[i] = -(1e9); a++; } } if(wyn > a) wyn = a; for(int i=1; i<=n; i++) tac[i] = tab[i]; a = 0; for(int i=2; i<=n; i++) { if(i % 2 == 0 && tac[i] >= tac[i-1]) { tac[i] = -(1e9); a++; } else if(i % 2 == 1 && tac[i] <= tac[i-1]) { tac[i] = 1e9; a++; } } if(wyn > a) wyn = a; cout<<wyn; 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 47 48 49 50 | #include<bits/stdc++.h> using namespace std; int tab[100009], tac[100009]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, a, wyn = 1e9; cin>>n; for(int i=1; i<=n; i++) cin>>tab[i]; for(int i=1; i<=n; i++) tac[i] = tab[i]; a = 0; for(int i=2; i<=n; i++) { if(i % 2 == 0 && tac[i] <= tac[i-1]) { tac[i] = 1e9; a++; } else if(i % 2 == 1 && tac[i] >= tac[i-1]) { tac[i] = -(1e9); a++; } } if(wyn > a) wyn = a; for(int i=1; i<=n; i++) tac[i] = tab[i]; a = 0; for(int i=2; i<=n; i++) { if(i % 2 == 0 && tac[i] >= tac[i-1]) { tac[i] = -(1e9); a++; } else if(i % 2 == 1 && tac[i] <= tac[i-1]) { tac[i] = 1e9; a++; } } if(wyn > a) wyn = a; cout<<wyn; return 0; } |