| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1134361 | Agageldi | Money (IZhO17_money) | C++20 | 0 ms | 324 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N 200005
#define pb push_back
#define ff first
#define ss second
#define sz(s) (int)s.size()
ll n, t, T, a[N], b[N], vis[N];
int main () {
ios::sync_with_stdio(0);cin.tie(0);
cin >> n;
bool tr = 0;
for(int i = 1; i <= n; i++) {
cin >> a[i];
}
int cnt = 0;
for(int i=1;i<n;i++) {
if(a[i] > a[i+1]) cnt++;
}
if(a[n] > a[n - 1]) cnt++;
cout << cnt << '\n';
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
