#include<bits/stdc++.h>usingnamespace std;
#define ll long longtemplate <classt>
inlinevoidread(t & res){
char ch;
while (ch = getchar(), !isdigit(ch));
res = ch ^ 48;
while (ch = getchar(), isdigit(ch))
res = res * 10 + (ch ^ 48);
}
constint e = 1e6 + 5, inf1 = 0x3f3f3f3f;
const ll inf2 = 0x3f3f3f3f3f3f3f3fll;
int a[e], adj[e], nxt[e], go[e], num = 1, c[e], f[e], w, s, t, pool, b[e], tot, n;
bool vis[e], walk[e];
ll co[e], dist[e], ans;
inlinevoidadd(int x, int y, int v, int w){
nxt[++num] = adj[x];
adj[x] = num;
go[num] = y;
c[num] = v;
co[num] = w;
nxt[++num] = adj[y];
adj[y] = num;
go[num] = x;
co[num] = -w;
}
inlineboolbfs(){
deque<int>q;
int i;
for (i = 1; i <= t; i++) walk[i] = 0, dist[i] = inf2;
q.push_front(s);
dist[s] = 0;
while (!q.empty())
{
int u = q.front();
q.pop_front();
vis[u] = 0;
for (i = adj[u]; i; i = nxt[i])
{
int v = go[i];
if (dist[v] > dist[u] + co[i] && c[i] > f[i])
{
dist[v] = dist[u] + co[i];
if (!vis[v])
{
vis[v] = 1;
if (q.empty() || dist[v] < dist[q.front()]) q.push_front(v);
else q.push_back(v);
}
}
}
}
return dist[t] < inf2;
}
inlineintdfs(int u, int a){
if (u == t || a == 0)
{
ans += dist[t] * a;
return a;
}
int i, flow = 0, f1;
walk[u] = 1;
for (i = adj[u]; i; i = nxt[i])
{
int v = go[i];
if (dist[v] == dist[u] + co[i] && c[i] > f[i] && !walk[v])
{
f1 = dfs(v, min(c[i] - f[i], a));
if (f1)
{
f[i] += f1;
f[i ^ 1] -= f1;
flow += f1;
a -= f1;
if (a == 0) break;
}
}
}
return flow;
}
inlinevoidinit(int l, int r){
if (l == r) return;
int i, mid = l + r >> 1;
tot = 0;
for (i = l; i <= r; i++) b[++tot] = a[i];
sort(b + 1, b + tot + 1);
tot = unique(b + 1, b + tot + 1) - b - 1;
for (i = 1; i < tot; i++)
{
add(pool + i, pool + i + 1, inf1, b[i + 1] - b[i]);
add(pool + i + 1, pool + i, inf1, b[i + 1] - b[i]);
}
for (i = mid + 1; i <= r; i++)
{
int pos = lower_bound(b + 1, b + tot + 1, a[i]) - b;
add(i, pool + pos, 1, 0);
}
for (i = l; i <= mid; i++)
{
int pos = lower_bound(b + 1, b + tot + 1, a[i]) - b;
add(pool + pos, i + n, 1, 0);
}
pool += tot; init(l, mid); init(mid + 1, r);
}
intmain(){
int i;
read(n); read(w);
for (i = 1; i <= n; i++) read(a[i]);
pool = 2 * n;
init(1, n);
s = pool + 1; t = s + 1;
for (i = 1; i <= n; i++) add(s, i, 1, 0), add(i + n, t, 1, 0), add(i, t, 1, w);
while (bfs()) dfs(s, inf1);
cout << ans << endl;
return0;
}
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步