//Wojciech Rybak Zbigniew100noga #include <bits/stdc++.h> using namespace std; #define int long long #define ll long long #define pb push_back #define nd second #define st first #define sz size #define forr(i, n) for(int i=1;i<=n;i++) const ll infl=1e18+90; const int inf=1e9+90; const int roz=1e5; int tab[roz], tab2[roz]; signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, wyn1=0, wyn2=0; cin>>n; for(int i=1;i<=n;i++) { cin>>tab[i]; tab2[i]=tab[i]; } for(int i=2;i<=n;i++) { //cerr<<"dla i = "<<i<<" wyn1 = "<<wyn1<<" wyn2 = "<<wyn2<<"\n"; if(i%2==0) { if(tab[i]<=tab[i-1]) { tab[i]=inf; wyn1++; } if(tab2[i]>=tab2[i-1]) { tab2[i]=-inf; wyn2++; } } else { if(tab2[i]<=tab2[i-1]) { tab2[i]=inf; wyn2++; } if(tab[i]>=tab[i-1]) { tab[i]=-inf; wyn1++; } } } //cerr<<wyn1<<" "<<wyn2<<"\n"; cout<<min(wyn1, wyn2)<<"\n"; }
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 51 52 53 54 55 56 57 58 59 60 | //Wojciech Rybak Zbigniew100noga #include <bits/stdc++.h> using namespace std; #define int long long #define ll long long #define pb push_back #define nd second #define st first #define sz size #define forr(i, n) for(int i=1;i<=n;i++) const ll infl=1e18+90; const int inf=1e9+90; const int roz=1e5; int tab[roz], tab2[roz]; signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, wyn1=0, wyn2=0; cin>>n; for(int i=1;i<=n;i++) { cin>>tab[i]; tab2[i]=tab[i]; } for(int i=2;i<=n;i++) { //cerr<<"dla i = "<<i<<" wyn1 = "<<wyn1<<" wyn2 = "<<wyn2<<"\n"; if(i%2==0) { if(tab[i]<=tab[i-1]) { tab[i]=inf; wyn1++; } if(tab2[i]>=tab2[i-1]) { tab2[i]=-inf; wyn2++; } } else { if(tab2[i]<=tab2[i-1]) { tab2[i]=inf; wyn2++; } if(tab[i]>=tab[i-1]) { tab[i]=-inf; wyn1++; } } } //cerr<<wyn1<<" "<<wyn2<<"\n"; cout<<min(wyn1, wyn2)<<"\n"; } |