POJ 3259 BellmanFord算法和poj2240几乎一样

注意重边和开始点不一定是1

#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<string>
#include<map>
#include<set>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<sstream>
#define ll long long
using namespace std;
const int N_MAX = 1000;
const int M_MAX = 100000;
const int INF = 0x00ffffff;
const double M_DBL_MAX = 1.7976931348623158e+308;
const double M_DBL_MIN = 2.2250738585072014e-308;
struct EdgeOfMap{  
  int l,r;  
  int weigth;  
  EdgeOfMap (int x,int y,int z){l=x,r=y,weigth=z;}  
  EdgeOfMap (){}  
  EdgeOfMap& operator = (const EdgeOfMap& src){  
    l=src.l;r=src.r;weigth=src.weigth;  
    return *this;  
  }  
};
/**********************************************************/
int n;
int myMap[N_MAX][N_MAX],dist[N_MAX];
EdgeOfMap theEdge[M_MAX];
int lenEdge=0;
/**********************************************************/
int min_2 (int x,int y) {return x<y?x:y;}
int max_2 (int x,int y) {return x>y?x:y;}
void swap (int& a, int& b){a^=b;b^=a;a^=b;}
bool bellman (int z);
/**********************************************************/
int main()
{
  //freopen ("in.txt","r",stdin);
  int f;
  scanf ("%d",&f);
  while (f--)
  {
	int m,w;
	scanf ("%d %d %d",&n,&m,&w);
	int a,b,c;
	lenEdge=0;
	for (int i=0;i<n;i++)
	  for (int j=0;j<n;j++)
		myMap[i][j]=INF;
	for (int i=0;i<m;i++){
	  scanf ("%d %d %d",&a,&b,&c);
	  if (myMap[a-1][b-1]>c)
		myMap[a-1][b-1]=myMap[b-1][a-1]=c;
	}
	for (int i=0;i<w;i++){
	  scanf ("%d %d %d",&a,&b,&c);
	  myMap[a-1][b-1]=-1*c;
	}
	for (int i=0;i<n;i++)
	  for (int j=0;j<n;j++)
		if (myMap[i][j]!=INF)
		  theEdge[lenEdge++]=EdgeOfMap (i,j,myMap[i][j]);
	bool sucs=false;
	for (int i=0;i<n;i++)
	  if (bellman (i)){sucs=true;break;}
	if (sucs)
	  printf ("YES\n");
	else printf ("NO\n");
  }
  return 0;
}
bool bellman (int z)
{
  for (int i=0;i<=n;i++) dist[i]=INF;
  dist[z]=0;
  for (int i=0;i<n-1;i++){
	bool flag=false;
	for (int j=0;j<lenEdge;j++){
	  int x=theEdge[j].l, y=theEdge[j].r;
	  if (dist[y]>dist[x]+theEdge[j].weigth){
		dist[y]=dist[x]+theEdge[j].weigth;
		flag=true;
	  }
	}
	if (!flag) break;
  }
  for (int i=0;i<lenEdge;i++)
	if (dist[theEdge[i].r]>dist[theEdge[i].l]+theEdge[i].weigth)
	  return true;
  return false;
}