Submission #444824

#TimeUsernameProblemLanguageResultExecution timeMemory
444824dutchGroup Photo (JOI21_ho_t3)C++17
100 / 100
303 ms67520 KiB
#include <bits/stdc++.h> using namespace std; const int MAXN = 5001, INF = 1e9; int n, a[MAXN], p[MAXN], dp[MAXN], inv[MAXN][MAXN]; signed main(){ cin.tie(0)->sync_with_stdio(0); cin >> n; for(int i=1; i<=n; ++i){ cin >> a[i]; p[a[i]] = i; } for(int j=2; j<=n; ++j){ int c = 0; for(int i=j-1; i; --i){ c += p[i] > p[j]; inv[i][j] = inv[i][j-1] + c; } } for(int i=1; i<=n; ++i){ dp[i] = INF; for(int j=0; j<i; ++j){ dp[i] = min(dp[i], dp[j] + inv[1][i] - inv[1][j] + ((i-j)*(i-j-1))/2 - 2 * inv[j+1][i]); } } cout << dp[n]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...