hnoi2013 (三)

2014-11-24 02:37:41 · 作者: · 浏览: 8
);
if (k > D) {
link (p[i][j][k], p[i + 1][j][k - D], oo);
link (p[i][j][k], p[i - 1][j][k - D], oo);
link (p[i][j][k], p[i][j + 1][k - D], oo);
link (p[i][j][k], p[i][j - 1][k - D], oo);
}
}
}

for (; bfs (); )
ans += dfs (S, oo);
printf ("%d\n", ans);
}