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;
int n, a[5001], dp[5001];
int cost (int l, int r) {
vector <int> u;
int cnt = 0, suff = 0;
for (int i = n; i >= 1; i--) {
if (a[i] >= l && a[i] <= r) {
u.push_back(a[i]); cnt += suff;
} else if (a[i] < l) suff++;
}
for (int j = 1; j < (int)u.size(); j++) {
for (int l = j - 1; l >= 0; l--) {
cnt += u[j] < u[l];
}
}
return cnt;
}
int main () {
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= n; i++) {
dp[i] = 1e9;
for (int j = i; j >= 1; j--) {
dp[i] = min(dp[i], dp[j - 1] + cost(j, i));
}
}
cout << dp[n] << '\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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |