ZOJ-2770-Burn the Linked Camp

ZOJ-2770-Burn the Linked Camp

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=1770

差分约束系统

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define INF 99999999
#define N 1001
#define E 25000
int n,m,ei;
int c[N];//第i个大营最多有c[i]个士兵
int dist[N];//源点到各顶点的最短距离,源点为sn
int d[N];//d[i]为前i个大营容量总和
struct eg
{
	int u,v,w;
}edges[E];
void init()
{
	int i;
	ei=0;
	for(i=0;i<=n;i++)
	dist[i]=INF;
	d[0]=0;
	dist[n]=0;  //sn为源点
}
int bellmanford()
{
	int i,k,t;
	for(i=0;i<n;i++)
	{
		for(k=0;k<ei;k++)
		{
			t=dist[edges[k].u]+edges[k].w;
			if(dist[edges[k].u]!=INF&&t<dist[edges[k].v])
			dist[edges[k].v]=t;
		}
	}
	for(k=0;k<ei;k++)
	{
		if(dist[edges[k].u]!=INF&&dist[edges[k].u]+edges[k].w<dist[edges[k].v])
		return 0;
	}
	return 1;
}
int main()
{
	int i,u,v,w;
	while(scanf("%d%d",&n,&m)!=EOF)
	{
		init();
		for(i=1;i<=n;i++)
		{
			scanf("%d",&c[i]);
			edges[ei].u=i-1;
			edges[ei].v=i;
			edges[ei].w=c[i];  //构造边<i-1,i>
			ei++;
			edges[ei].u=i;
			edges[ei].v=i-1;
			edges[ei].w=0;    //构造边<i,i-1>
			ei++;
			d[i]=c[i]+d[i-1];
		}
		for(i=0;i<m;i++)
		{
			scanf("%d %d %d",&u,&v,&w);
			edges[ei].u=v;
			edges[ei].v=u-1;
			edges[ei].w=-w;  //构造边<v,u-1>
			ei++;
			edges[ei].u=u-1;
			edges[ei].v=v;
			edges[ei].w=d[v]-d[u-1]; //构造边<u-1,v>
			ei++;
		}
		if(!bellmanford())
		printf("Bad Estimations\n");
		else
		printf("%d\n",dist[n]-dist[0]);
	}
	return 0;
}