Spy97的博客

#pragma GCC optimize(3)//手动Ox优化#include<bits/stdc++.h>#define N 3010#define inf 0x3f3f3f3f#define eps 1e-5#define pi 3.141592653589793#define mod 998244353#define P 1000000007#define LL ...

Subway ChasingProblem DescriptionMr. Panda and God Sheep are roommates and working in the same company. They always take subway to work together. There are N subway stations on their route, number...

Schedule ProblemProblem DescriptionA project can be divided into several parts. Each part should be completed continuously. This means if a part should take 3 days, we should use a continuous 3 da...

首先根据题目的要求进行不等式组的标准化。(1)、如果要求取最小值，那么求出最长路，那么将不等式全部化成xi – xj &gt;= k的形式，这样建立j-&gt;i的边，权值为k的边，如果不等式组中有xi – xj &gt; k，因为一般题目都是对整形变量的约束，化为xi – xj &gt;= k+1即可，如果xi – xj = k呢，那么可以变为如下两个：xi – xj &gt;= k, xi...