旺崽的博客

2020牛客暑期多校训练营（第一场）H.Minimum-cost Flow 题目链接 题目描述 Bobo has a network of nn nodes and mm arcs. The iii-th arc goes from the aia_iai​-th node to the bib_ibi​-th node, with cost cic_ici​. Bobo also asks q questions. The ii-th question is specified by two intege

洛谷 P3381 【模板】最小费用最大流 题目链接 题目描述 如题，给出一个网络图，以及其源点和汇点，每条边已知其最大流量和单位流量费用，求出其网络最大流和在最大流情况下的最小费用。 输入格式 第一行包含四个正整数N、M、S、T，分别表示点的个数、有向边的个数、源点序号、汇点序号。 接下来M行每行包含四个正整数ui、vi、wi、fi，表示第i条有向边从ui出发，到达vi，边权为wi（即该边最大流量为wi），单位流量的费用为fi。 输出格式 一行，包含两个整数，依次为最大流量和在最大流量情况下的最小费用。 样

POJ 2135 Farm Tour 题目链接 Description When FJ’s friends visit him on the farm, he likes to show them around. His farm comprises N (1 <= N <= 1000) fields numbered 1…N, the first of which contains his house and the Nth of which contains the big barn. A