#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <string>
#include <array>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#include <set>
#define INF 1e9
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const ll MAXN = 300005;
void solve() {
int n; cin >> n;
vector<ll>v(n);
for (int i = 0; i < n; i++)cin >> v[i];
int ans = 1;
for (int i = 1; i < n; i++) {
if (v[i] > v[i - 1])++ans;
}
cout << ans << "\n";
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;// cin>>t;
while (t--) solve();
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |