给出下列不等式:
x1 - x2 <= 0
x1 - x5 <= -1
x2 - x5 <= 1
x3 - x1 <= 5
x4 - x1 <= 4
x4 - x3 <= -1
x5 - x3 <= -3
x5 - x4 <= -3
求出该不等式组的一组解;
对于此不等式组,可将其稍作变形:X1<=X2+0;结合SPFA算法中的最短路径性质:dis[u]<=dis[v]+edge[i].val,可把X2,X1,看作两个点,0看作X2到X1的边权,另外加一个点当作起点,就可以使用SPFA算法求出一组解;具体请参考代码:
#include<stdio.h>
#include<string.h>
#include<queue>
using namespace std;
#define INF 0x3f3f3f3f
#define MAX 1010
int head[MAX];
int dis[MAX];
int mark[MAX];
int used[MAX];
struct node{
int from,to,val,next;
};
node edge[MAX];
int num,n,m;
void getmap(int u,int v,int w)
{
node e={u,v,w,head[u]};
edge[num]=e;
head[u]=num++;
}
void SPFA(int s)
{
queue<int>q;
memset(mark,0,sizeof(mark));
memset(dis,INF,sizeof(dis));
memset(used,0,sizeof(used));
q.push(s);
used[s]++;
mark[s]=1;
dis[0]=0;
while(!q.empty())
{
int top=q.front();
q.pop();
mark[top]=0;
for(int i=head[top];i!=-1;i=edge[i].next)
{
int u=edge[i].to;
if(dis[u]>dis[top]+edge[i].val)
{
dis[u]=dis[top]+edge[i].val;
if(!mark[u])
{
mark[u]=1;
q.push(u);
used[u]++;
if(used[u]>n)
{
printf("No answer\n");
return ;
}
}
}
}
}
}
int main()
{
while(scanf("%d%d",&n,&m),n||m)
{
num=0;
memset(head,-1,sizeof(head));
for(int i=1;i<=n;i++)
{
getmap(0,i,0);
}
for(int i=1;i<=m;i++)
{
int a,b,d;
scanf("%d%d%d",&a,&b,&d);// a - b <= d;b到a的权值为d
getmap(b,a,d);
}
SPFA(0);
for(int i=1;i<=n;i++)
printf("X%d = %d\n",i,dis[i]);
}
return 0;
}