#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 228;
int n, a[N];
int main(){
cin.tie(0); cout.tie(0); iostream::sync_with_stdio(false); ios_base::sync_with_stdio(false);
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
a[0] = 0;
int kol = 0;
for (int i = 1; i <= n; i++) if (a[i] > a[i - 1]) kol++;
cout << kol;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
2 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
3 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
4 |
Incorrect |
5 ms |
492 KB |
Output isn't correct |
5 |
Incorrect |
6 ms |
620 KB |
Output isn't correct |
6 |
Correct |
12 ms |
748 KB |
Output is correct |
7 |
Incorrect |
12 ms |
748 KB |
Output isn't correct |