传送门
题解:
首先这道题的费用流模型是很明显的。
直接建图边数是 O ( n 2 ) O(n^2) O(n2)的听说能过???
但是实际上可以直接分治,然后将 a a a值拿出来排序去重,然后排成一排相邻两点连费用为绝对值之差,容量无限的边。
然后当前分治区间所有点向自己的 a a a值连边,按照它是前半还是后半分别连入边和出边。
当然这个也就很显然地可以线段树优化建图了。
代码:
#include<bits/stdc++.h>
#define ll long long
#define re register
#define cs const
using std::cerr;
using std::cout;
using pii=std::pair<int,int>;
#define fi first
#define se second
int S,T,tot;
namespace NetWork{
cs int N=1e5+7;cs ll INF=0x3f3f3f3f3f3f3f;
struct edge{int to,rev,cap,w;};
typedef std::vector<edge>::iterator iter;
std::vector<edge> G[N];iter cur[N];
inline void adde(int u,int v,int cap,int cost){
G[u].push_back((edge){v,G[v].size(),cap,cost});
G[v].push_back((edge){u,G[u].size()-1,0,-cost});
}
ll dis[N];bool vis[N];
inline bool SPFA(){
memset(dis+1,0x3f,sizeof(ll)*tot);
memset(vis+1,0,sizeof(bool)*tot);
std::deque<int> q(1,S);dis[S]=0;
while(!q.empty()){
int u=q.front();q.pop_front();
vis[u]=false;cur[u]=G[u].begin();
for(auto &e:G[u])if(e.cap&&dis[e.to]>dis[u]+e.w){
dis[e.to]=dis[u]+e.w;
if(!vis[e.to]){
if(!q.empty()&&dis[e.to]<dis[q.front()])q.push_front(e.to);
else q.push_back(e.to);
vis[e.to]=true;
}
}
}
return dis[T]<INF;
}
ll tot_cost;int tot_flow;
int dfs(int u,int flow){
if(u==T){
tot_flow+=flow;
tot_cost+=flow*dis[T];
return flow;
}
vis[u]=true;int ans=0;
for(iter &e=cur[u];e!=G[u].end();++e)
if(e->cap&&!vis[e->to]&&dis[e->to]==dis[u]+e->w){
int delta=dfs(e->to,std::min(flow-ans,e->cap));
if(!delta){vis[e->to]=true;continue;}
e->cap-=delta;
G[e->to][e->rev].cap+=delta;
if((ans+=delta)==flow)break;
}
vis[u]=false;return ans;
}
inline void Flow(){
tot_flow=tot_cost=0;
while(SPFA())dfs(S,INF);
}
}
using NetWork::adde;
cs int N=1e3+7;
int n,m,a[N];
void work(int l,int r){
if(l==r)return ;int mid=l+r>>1,tl=0;
work(l,mid),work(mid+1,r);static int t[N];
for(int re i=l;i<=r;++i)t[++tl]=a[i];
std::sort(t+1,t+tl+1);tl=std::unique(t+1,t+tl+1)-t-1;
for(int re i=1;i<tl;++i){
adde(tot+i,tot+i+1,1e9,t[i+1]-t[i]);
adde(tot+i+1,tot+i,1e9,t[i+1]-t[i]);
}
for(int re i=l;i<=r;++i){
int p=std::lower_bound(t+1,t+tl+1,a[i])-t;
(i<=mid)?adde(tot+p,n+i,1,0):adde(i,tot+p,1,0);
}
tot+=tl;
}
signed main(){
#ifdef zxyoi
freopen("mail.in","r",stdin);
#endif
scanf("%d%d",&n,&m);S=n*2+1,T=tot=S+1;
for(int re i=1;i<=n;++i){
scanf("%d",a+i);
adde(S,i,1,0);
adde(i,T,1,m);
adde(i+n,T,1,0);
}
work(1,n);NetWork::Flow();
cout<<NetWork::tot_cost<<"\n";
return 0;
}