典型的差分约束的题目。#include<iostream>#include<stdio.h>#include<queue>#include<string.h>#define MAXD 110using namespace std;int N,M,graph[MAXD][MAXD],dis[MAXD];bool vis[MAXD][MAXD];int bellman(){ memset(dis,0x3f,sizeof(dis)); dis[0]=0; int k,i,j; int num=N+1; for(k=1;k<=num;k++) { Read More
