显然的一个想法是按照权值排序
从前往后扫
如果当前类型的根还没有被扫到的话就挂到根后面
否则接到上一个已经计算过的权值后面
扫到每个根的时候先把所有挂着的算了
发现对于多个根我们可以合并扫之前的点的过程
可以证明的是我们一定只合并一段前缀和后缀
即扫的顺序是
l
.
.
.
1...
l
.
.
.
r
.
.
.
n
.
.
.
r
l...1...l...r...n...r
l...1...l...r...n...r这样的
从前往后枚举
r
r
r维护此时最优的
l
l
l
然后权值从大到小再做一次
#include<bits/stdc++.h>
using namespace std;
#define cs const
#define re register
#define pb push_back
#define int long long
#define pii pair<int,int>
#define ll long long
#define y1 shinkle
#define fi first
#define se second
#define bg begin
cs int RLEN=1<<20|1;
inline char gc(){
static char ibuf[RLEN],*ib,*ob;
(ib==ob)&&(ob=(ib=ibuf)+fread(ibuf,1,RLEN,stdin));
return (ib==ob)?EOF:*ib++;
}
inline int read(){
char ch=gc();
int res=0;bool f=1;
while(!isdigit(ch))f^=ch=='-',ch=gc();
while(isdigit(ch))res=(res+(res<<2)<<1)+(ch^48),ch=gc();
return f?res:-res;
}
inline ll readll(){
char ch=gc();
ll res=0;bool f=1;
while(!isdigit(ch))f^=ch=='-',ch=gc();
while(isdigit(ch))res=(res+(res<<2)<<1)+(ch^48),ch=gc();
return f?res:-res;
}
inline int readstring(char *s){
int top=0;char ch=gc();
while(isspace(ch))ch=gc();
while(!isspace(ch)&&ch!=EOF)s[++top]=ch,ch=gc();
s[top+1]='\0';return top;
}
template<typename tp>inline void chemx(tp &a,tp b){a=max(a,b);}
template<typename tp>inline void chemn(tp &a,tp b){a=min(a,b);}
cs int N=1000005;
int n,m,bel[N],id[N],t[N],rk[N];
ll val[N],ans;
vector<int>anc;
inline void solve(){
for(int i=1;i<=n;i++)rk[id[i]]=i,t[i]=0;
for(int i=m+1;i<=n;i++)
if(rk[i]<rk[bel[i]])
t[rk[i]]++,t[rk[bel[i]]]--;
for(int i=1;i<=n;i++)t[i]+=t[i-1];
int s=-1,d=-1,j=0;ll vl=0;
for(int i=2;i<=n;i++){
ll tp1=vl+(t[i-1]?2:0)*(val[id[i]]-val[id[i-1]]),tp2=val[id[i]]-val[id[1]];
if(tp1<tp2)vl=tp1;
else vl=tp2,j=i;
ll now=vl+val[id[n]]-val[id[1]]+val[id[n]]-val[id[i]];
if(now<ans)ans=now,s=j,d=i;
}
if(s!=-1){
if(s==d)s=d=n;
anc.clear();
for(int i=s;i;i--)if(id[i]<=m)anc.pb(id[i]);
for(int i=1;i<=s;i++)if(id[i]>m)anc.pb(id[i]);
for(int i=d;i<n;i++)t[i]=1;
for(int i=s+1;i<=n;i++){
if(id[i]<=m||rk[bel[id[i]]]<i){
anc.pb(id[i]);
if(!t[i]){
for(int j=i-1;i>s&&t[j];j--)
if(id[j]>m&&rk[bel[id[j]]]>j)
anc.pb(id[j]);
}
}
}
}
}
signed main(){
#ifdef Stargazer
freopen("lx.in","r",stdin);
#endif
n=read(),m=read(),ans=4e18;
for(int i=1;i<=n;i++)val[i]=read(),id[i]=i;
for(int i=1;i<=n-m;i++)bel[i+m]=read();
sort(id+1,id+n+1,[](cs int &i,cs int &j){return val[i]<val[j];});
solve();
for(int i=1;i<=n;i++)val[i]=-val[i];
reverse(id+1,id+n+1);
solve();
cout<<ans<<'\n';
for(int &x:anc)cout<<x<<" ";
return 0;
}