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 MAXN = 1000001;
int a[MAXN], dp[MAXN];
int ans[301][301];
bool issorted(int l, int r) {
return r - l + 1 <= dp[r];
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
if (n <= 300) {
for (int i = 1; i <= n; i++) {
if (a[i] > a[i - 1])
dp[i] = dp[i - 1] + 1;
else dp[i] = 1;
}
set < int > st;
int ans = 0;
for (int i = 0; i < n; i++) {
auto it = st.upper_bound(a[i]);
if (it != st.end()) ans++;
st.insert(a[i]);
}
cout << ans << '\n';
}
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... |