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], pos[501];
int main () {
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= n; i++) {
dp[i] = 1e9;
int sze = 0;
memset(pos, 0, sizeof(pos));
for (int j = 1; j <= n; j++) {
if (a[j] <= i) {
pos[a[j]] = ++sze;
}
}
for (int j = i; j >= 1; j--) {
int sum = 0;
int cnt = j;
for (int l = i; l >= j; l--) {
sum += abs(cnt - pos[l]);
cnt++;
}
sum += dp[j - 1];
dp[i] = min(dp[i], sum);
}
}
//for (int i = 1; i <= n; i++) cout << dp[i] << " ";
//cout << '\n';
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... |