题目链接
题目就是给出N个数,保证他们的和是小于等于N的,最后使得所有的点的权值都是小于等于1的,问最小的移动次数,每次是只能移动1。
然后一开始的时候,想的是跑费用流,太明显费用流是可以求解的,但是无论是Dijkstra优化的费用流还是spfa的费用流解法,都是接二连三的T了。
然后的话,看了看数据范围,想了一下,N个a[i]的总和是小于等于N的,所以,我们现在考虑一下,现在某个点的权值是大于1的,那么大于1的部分就是需要去移动到值为0的位置上去,所以这里的话,我们可以把所有权值大于1的部分拆成点,然后每个点对每个0权值位置进行连边,边权是距离(环)。
#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define MP(a, b) make_pair(a, b)
#define Min3(a, b, c) min(a, min(b, c))
using namespace std;
typedef unsigned long long ull;
typedef unsigned int uit;
typedef long long ll;
const int maxN = 5e2 + 7;
int N, a[maxN], cnt_x, cnt_y;
struct KM
{
int n, mp[maxN][maxN], link_x[maxN], link_y[maxN];
bool vis_x[maxN], vis_y[maxN];
int que[maxN], top, fail, pre[maxN];
ll hx[maxN], hy[maxN], slk[maxN];
bool check(int i)
{
vis_x[i] = true;
if(link_x[i])
{
que[fail++] = link_x[i];
vis_y[link_x[i]] = true;
return true;
}
while(i)
{
link_x[i] = pre[i];
swap(i, link_y[pre[i]]);
}
return false;
}
void bfs(int S)
{
for(int i=1; i<=n; i++)
{
slk[i] = INF;
vis_x[i] = vis_y[i] = false;
}
top = 0; fail = 1; que[0] = S;
vis_y[S] = true;
while(true)
{
ll d = 0;
while(top < fail)
{
for(int i=1, j = que[top++]; i<=n; i++)
{
if(!vis_x[i] && slk[i] >= (d = hx[i] + hy[j] - mp[i][j]))
{
pre[i] = j;
if(d) slk[i] = d;
else if(!check(i)) return;
}
}
}
d = INF;
for(int i=1; i<=n; i++)
{
if(!vis_x[i] && d > slk[i]) d = slk[i];
}
for(int i=1; i<=n; i++)
{
if(vis_x[i]) hx[i] += d;
else slk[i] -= d;
if(vis_y[i]) hy[i] -= d;
}
for(int i=1; i<=n; i++)
{
if(!vis_x[i] && !slk[i] && !check(i)) return;
}
}
}
void init()
{
for(int i=1; i<=n; i++)
{
link_x[i] = link_y[i] = 0;
hy[i] = slk[i] = 0;
vis_y[i] = false;
}
for(int i=1; i<=n; i++)
{
hx[i] = 0;
for(int j=1; j<=n; j++)
{
if(hx[i] < mp[i][j]) hx[i] = mp[i][j];
}
}
}
void solve()
{
n = N;
init();
for(int i=1; i<=n; i++) bfs(i);
ll ans = 0;
for(int i=1; i<=n; i++) ans += hx[i] + hy[i];
printf("%lld\n", -ans);
}
}km;
int main()
{
vector<int> zero;
vector<pair<int, int>> vt;
int id_zero[maxN];
while(scanf("%d", &N) != EOF)
{
zero.clear();
vt.clear();
for(int i=1; i<=N; i++) for(int j=1; j<=N; j++) km.mp[i][j] = 0;
for(int i=1; i<=N; i++)
{
scanf("%d", &a[i]);
if(!a[i]) { zero.push_back(i); continue; }
a[i] -= 1;
if(a[i])
{
vt.push_back(MP(i, a[i]));
}
}
cnt_x = cnt_y = 0;
int len_zero = (int)zero.size(), len_vt = (int)vt.size();
for(int i=0; i<len_zero; i++)
{
id_zero[i] = ++cnt_y;
}
for(int i=0; i<len_vt; i++)
{
for(int j=1; j<=vt[i].second; j++)
{
++cnt_x;
for(int k=0; k<len_zero; k++)
{
km.mp[cnt_x][id_zero[k]] = -min(abs(zero[k] - vt[i].first), N - abs(zero[k] - vt[i].first));
}
}
}
km.n = max(cnt_x, cnt_y);
km.solve();
}
return 0;
}