# |
제출 시각 |
아이디 |
문제 |
언어 |
결과 |
실행 시간 |
메모리 |
523274 |
2022-02-07T09:57:27 Z |
tato |
Po (COCI21_po) |
C++14 |
|
38 ms |
1644 KB |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
void answer()
{
int n;
cin >> n;
int a[n + 1];
for(int i = 1; i <= n; i++)
cin >> a[i];
int cnt = 1;
for(int i = 2; i <= n; i++)
if(a[i] > a[i-1])
cnt++;
cout << cnt;
}
int main()
{
int t = 1;
//cin >> t;
while(t--)
answer();
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
2 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
3 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
4 |
Incorrect |
8 ms |
604 KB |
Output isn't correct |
5 |
Incorrect |
12 ms |
684 KB |
Output isn't correct |
6 |
Correct |
37 ms |
1540 KB |
Output is correct |
7 |
Incorrect |
38 ms |
1644 KB |
Output isn't correct |