Submission #1106996

#TimeUsernameProblemLanguageResultExecution timeMemory
1106996dubabubaMoney (IZhO17_money)C++14
0 / 100
1 ms2384 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...