# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
392984 | 2021-04-22T13:23:40 Z | sumit_kk10 | Po (COCI21_po) | C++14 | 12 ms | 648 KB |
#include <bits/stdc++.h> #define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL) #define ll long long int #define ld long double using namespace std; const int N = 1e6 + 5; const int MOD = 1e9 + 7; int main(){ fast; int n; cin >> n; int a[n]; for(int i = 1; i <= n; ++i) cin >> a[i]; int mx = 0, ans = 0; a[0] = 0; for(int i = 1; i <= n; ++i){ if(a[i] > a[i - 1]){ mx = a[i]; ++ans; } } cout << ans << '\n'; return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Incorrect | 1 ms | 204 KB | Output isn't correct |
3 | Incorrect | 1 ms | 204 KB | Output isn't correct |
4 | Incorrect | 4 ms | 460 KB | Output isn't correct |
5 | Incorrect | 6 ms | 588 KB | Output isn't correct |
6 | Correct | 12 ms | 588 KB | Output is correct |
7 | Incorrect | 11 ms | 648 KB | Output isn't correct |