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 int long long
const int N=5050;
int lc[2*N],rc[2*N],sum[2*N],nc,root;
void Update(int &c,int ss,int se,int qind,int qval)
{
if(!c) c=++nc;
if(ss==se) {sum[c]=qval;return;}
int mid=(ss+se)/2;
if(qind<=mid) Update(lc[c],ss,mid,qind,qval);
else Update(rc[c],mid+1,se,qind,qval);
sum[c]=sum[lc[c]]+sum[rc[c]];
}
int Get(int c,int ss,int se,int qs,int qe)
{
if(qs<=ss && se<=qe) return sum[c];
else if(qe<ss || se<qs) return 0;
int mid=(ss+se)/2;
return Get(lc[c],ss,mid,qs,qe)+Get(rc[c],mid+1,se,qs,qe);
}
signed main()
{
int n;cin>>n;
int a[n+1],ind[n+1];for(int i=1;i<=n;i++){cin>>a[i];ind[a[i]]=i;}
int dp[n+50];
dp[n+1]=0;
for(int i=n;i>=1;i--)
{
int s=0,b[n+1]={0};
for(int j=i;j<=n;j++)
{
Update(root,1,n,ind[j],1);
}
for(int j=i;j<=n;j++)
{
b[j]=Get(root,1,n,1,ind[j])-1;
}
for(int j=i;j<=n;j++)
{
Update(root,1,n,ind[j],0);
}
for(int j=i;j<=n;j++)
{
int k=ind[j],x=Get(root,1,n,k,n);
s-=x;
s+=b[j];
dp[i]=min(dp[i],dp[j+1]+s);
Update(root,1,n,k,1);
}
for(int j=i;j<=n;j++)
{
Update(root,1,n,ind[j],0);
}
}
cout<<dp[1]<<endl;
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... |