图论
图论算法
对你说的对
这个作者很懒,什么都没留下…
展开
-
HDU5294 Tricks Device(最大流+最短路)
题目链接 一个无向图,走最短路从起点走到终点,问最少需要删除多少边使得其不能从起点走到终点,问最多删除多少点使得其能走到终点。思路: 最大流+最短路 先求出所有在最短路上的边,对这些边重建图。将其权值改为1,那么其最大流就是其最小割。#include<bits/stdc++.h>using namespace std;const int maxn=21...原创 2018-07-18 22:28:10 · 104 阅读 · 0 评论 -
2018ACM-ICPC 2018 南京赛区网络预赛--Magical Girl Haze(最短路)
题目链接There areNNcities in the country, andMMdirectional roads fromuutov(1\le u, v\le n)v(1≤u,v≤n). Every road has a distancec_ici. Haze is a Magical Girl that lives in City11, she can choos...原创 2018-09-02 19:55:40 · 140 阅读 · 0 评论 -
POJ Checking an Alibi(最短路)
A crime has been comitted: a load of grain has been taken from the barn by one of FJ's cows. FJ is trying to determine which of his C (1 <= C <= 100) cows is the culprit. Fortunately, a passing satell原创 2017-08-19 18:58:06 · 151 阅读 · 0 评论 -
POJ part acquisition(最短路)
The cows have been sent on a mission through space to acquire a new milking machine for their barn. They are flying through a cluster of stars containing N (1 <= N <= 50,000) planets, each with a trad原创 2017-08-18 20:30:43 · 161 阅读 · 0 评论 -
HDU 畅通工程(最小生成树)
省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通(但不一定有直接的公路相连,只要能间接通过公路可达即可)。经过调查评估,得到的统计表中列出了有可能建设公路的若干条道路的成本。现请你编写程序,计算出全省畅通需要的最低成本。Input测试输入包含若干测试用例。每个测试用例的第1行给出评估的道路条数 N、村庄数目M ( 行对应村庄间道路的成本,每行给出一对正整数,分别是原创 2017-08-16 21:35:06 · 390 阅读 · 0 评论 -
POJ Out of Hay(最小生成树)
DescriptionThe cows have run out of hay, a horrible event that must be remedied immediately. Bessie intends to visit the other farms to survey their hay situation. There are N (2 <= N <= 2,000) farm原创 2017-08-16 21:49:27 · 194 阅读 · 0 评论