Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int main()
- {
- int n,z[100000],max=1000001;
- cin>>n;
- for(int i=0;i<n;i++)
- {
- cin>>z[i];
- }
- for(int g=0;g<n;g++)
- {
- if(g==0)
- {
- if(z[g]>z[g+1] && z[g]>=0 && z[g]<max)
- {
- max=z[g];
- }
- }
- else if(g==(n-1))
- {
- if(z[g]>z[g-1] && z[g]>=0 && z[g]<max)
- {
- max=z[g];
- }
- }
- else
- {
- if(z[g]>z[g-1] && z[g]>z[g+1] && z[g]>=0 && z[g]<max)
- {
- max=z[g];
- }
- }
- }
- if(max!=1000001){cout<<max<<endl;}else{cout<<"NO"<<endl;}
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement