-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathA.cpp
49 lines (33 loc) · 832 Bytes
/
A.cpp
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
/***** American International University Bangladesh (AIUB)
Hadiur Rahman Nabil
Z3R0-DAY
*****/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n,count=0;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
ll max=arr[0];
ll min=arr[0];
for(int i=0;i<n;i++){
if(arr[i]>max)
{
max=arr[i];
count++;
}
if(arr[i]<min)
{
min=arr[i];
count++;
}
}
cout<<count;
return 0;
}