Codeforces 1082G - Petya and Graph - 网络流
Codeforces 1082G - Petya and Graph - 网络流题解链接https://lucien.ink题目链接https://codeforces.com/contest/1082/problem/G题目Petya has a simple graph (that is, a graph without loops or multiple edges) consisti...
Codeforces 1082G - Petya and Graph - 网络流题解链接https://lucien.ink题目链接https://codeforces.com/contest/1082/problem/G题目Petya has a simple graph (that is, a graph without loops or multiple edges) consisti...
题目链接http://codeforces.com/gym/101606题目High-rise buildings in the wealthy retail district of Knightsbridge are usually built with exotic hoisting machines known, in construction circles, as cranes.W...
题目链接:http://exam.upc.edu.cn/problem.php?id=5120题目:题目描述Open-pit mining is a surface mining technique of extracting rock or minerals from the earth by their removal from an open pit or borrow. Open-p...
链接:https://www.lucien.ink/go/bzoj1070/题目:Description 同一时刻有N位车主带着他们的爱车来到了汽车维修中心。维修中心共有M位技术人员,不同的技术人员对不同的车进行维修所用的时间是不同的。现在需要安排这M位技术人员所维修的车及顺序,使得顾客平均等待的时间最小。 说明:顾客的等待时间是指从他把车送至维修中心到维修完毕所用的时间。Input 第...