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;
#define all(v) v.begin(), v.end()
typedef long long ll;
const int NMAX = 5005;
int n, h[NMAX], ix[NMAX], big[NMAX], cnt[NMAX][NMAX], dp[NMAX];
int main(void){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n;
for(int i = 1; i <= n; i++) cin >> h[i], ix[h[i]] = i;
for(int i = 1; i <= n; i++)
for(int j = 1; j < i; j++)
if(h[j] > h[i]) big[h[i]]++;
for(int i = 1; i <= n; i++)
for(int j = i - 1; j; j--)
cnt[i][j] = cnt[i][j + 1] + (ix[j] < ix[i]);
memset(dp, 0x3f, sizeof(dp));
dp[0] = 0;
for(int i = 1; i <= n; i++){
int cur = dp[i - 1];
for(int j = i; j <= n; j++){
cur += big[j] + 2 * cnt[j][i] - j + i;
dp[j] = min(dp[j], cur);
}
}
cout << dp[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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |