差分约束分为最短路和最长路两种形式。
最短路主要用于求解最大解,最长路主要用于求解最小解,当求可行解时两者均可。
最短路差分与最长路差分有细微差别,请注意。
最短路模板
const int maxn=5005;
struct Edge {
int from,to,dist;
};
struct Difference_Constraints { //差分约束系统(最短路)
int n,m;
vector<Edge>edges;
vector<int>G[maxn];
bool inque[maxn];
int dist[maxn],used[maxn];
int ans[maxn]; //ans表示不等式组答案
void init(int n) {
this->n=n;
edges.clear();
for(int i=0; i<=n; i++)G[i].clear();
}
void AddEdge(int from,int to,int dist) {
edges.push_back((Edge) {
from,to,dist
});
m=edges.size();
G[from].push_back(m-1);
}
void insert(int x,int y,int v,bool flag) { //x-y<=v (flag=0),x-y>=v (flag=1)
if(flag==0)AddEdge(y,x,v);
if(flag==1)AddEdge(x,y,-v);
}
bool spfa(int s) {
for(int i=0; i<=n; i++)dist[i]=0x7fffffff/2;
memset(inque,0,sizeof(inque));
memset(used,0,sizeof(used));
deque<int>Q;
Q.push_back(s);
dist[s]=0;
inque[s]=1;
used[s]++;
while(!Q.empty()) {
int Now=Q.front();
Q.pop_front();
inque[Now]=0;
for(int i=0; i<G[Now].size(); i++) {
Edge& e=edges[G[Now][i]];
int Next=e.to;
if(dist[Next]>dist[Now]+e.dist) {
dist[Next]=dist[Now]+e.dist;
if(!inque[Next]) {
used[Next]++;
if(used[Next]>n+1)return false; //负权回环
if(!Q.empty()&&dist[Next]<dist[Q.front()])Q.push_front(Next); //SLF优化
else Q.push_back(Next);
inque[Next]=1;
}
}
}
}
return true;
}
bool main(int Start) { //求出正整数解
if(spfa(Start)==0)return false;
int Min=0x7fffffff/2;
for(int i=0; i<=n; i++)Min=min(Min,dist[i]); //转为正数
for(int i=0; i<=n; i++)ans[i]=dist[i]-Min;
return true;
}
void Output() {
for(int i=0; i<=n; i++)printf("%d\n",ans[i]);
}
};
最长路模板
const int maxn=5005;
struct Edge {
int from,to,dist;
};
struct Difference_Constraints { //差分约束系统(最长路)
int n,m;
vector<Edge>edges;
vector<int>G[maxn];
bool inque[maxn];
int dist[maxn],used[maxn];
int ans[maxn]; //ans表示不等式组答案
void init(int n) {
this->n=n;
edges.clear();
for(int i=0; i<=n; i++)G[i].clear();
}
void AddEdge(int from,int to,int dist) {
edges.push_back((Edge) {
from,to,dist
});
m=edges.size();
G[from].push_back(m-1);
}
void insert(int x,int y,int v,bool flag) { //x-y>=v (flag=0),x-y<=v (flag=1)
v*=-1;
if(flag==0)AddEdge(y,x,v);
if(flag==1)AddEdge(x,y,-v);
}
bool spfa(int s) {
for(int i=0; i<=n; i++)dist[i]=0x7fffffff/2;
memset(inque,0,sizeof(inque));
memset(used,0,sizeof(used));
deque<int>Q;
Q.push_back(s);
dist[s]=0;
inque[s]=1;
used[s]++;
while(!Q.empty()) {
int Now=Q.front();
Q.pop_front();
inque[Now]=0;
for(int i=0; i<G[Now].size(); i++) {
Edge& e=edges[G[Now][i]];
int Next=e.to;
if(dist[Next]>dist[Now]+e.dist) {
dist[Next]=dist[Now]+e.dist;
if(!inque[Next]) {
used[Next]++;
if(used[Next]>n+1)return false; //负权回环
if(!Q.empty()&&dist[Next]<dist[Q.front()])Q.push_front(Next); //SLF优化
else Q.push_back(Next);
inque[Next]=1;
}
}
}
}
return true;
}
bool main(int Start) { //求出正整数解
if(spfa(Start)==0)return false;
for(int i=0; i<=n; i++)dist[i]*=-1;
int Min=0x7fffffff/2;
for(int i=0; i<=n; i++)Min=min(Min,dist[i]); //转为正数
for(int i=0; i<=n; i++)ans[i]=dist[i]-Min;
return true;
}
void Output() {
for(int i=0; i<=n; i++)printf("%d\n",ans[i]);
}
};