用bellman_ford判断图中有无负环。可假设存在某一源点到各点距离为0，即初始化数组value为零。数据里边的数貌似不止2500，最开始数组开小了结果RE。#include<iostream>#include<stdio.h>#include<string.h>#define MAXD 510using namespace std;int F,N,M,W,S,E,T;struct NODE{ int v1; int v2; int d; //d为边权值}node[10*MAXD]; //用node记录边int bellman_ford(){ int v Read More
