This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int mxn = 1e6 + 10;
int a[mxn], dp[mxn], n;
int main() {
cin >> n;
for(int i = 1; i <= n; i++)
cin >> a[i];
a[0] = 1e9 + 10;
dp[0] = 0;
for(int i = 1; i <= n; i++) {
if(a[i - 1] <= a[i])
dp[i] = dp[i - 1];
else
dp[i] = dp[i - 1] + 1;
}
cout << dp[n] << endl;
return 0;
}
# | 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... |