ZOJ2770Burn the Linked Camp(差分约束+SPFA)

Burn the Linked Camp

---

Time Limit: 2 Seconds       Memory Limit: 65536 KB

---

It is well known that, in the period of The Three Empires, Liu Bei, the emperor of the Shu Empire, was defeated by Lu Xun, a general of the Wu Empire. The defeat was due to Liu Bei's wrong decision that he divided his large troops into a number of camps, each of which had a group of armies, and located them in a line. This was the so-called "Linked Camps".

Let's go back to that time. Lu Xun had sent many scouts to obtain the information about his enemy. From his scouts, he knew that Liu Bei had divided his troops into n camps, all of which located in a line, labeled by 1..n from left to right. The ith camp had a maximum capacity of Ci soldiers. Furthermore, by observing the activities Liu Bei's troops had been doing those days, Lu Xun could estimate the least total number of soldiers that were lived in from the ith to the jth camp. Finally, Lu Xun must estimate at least how many soldiers did Liu Bei had, so that he could decide how many troops he should send to burn Liu Bei's Linked Camps.

Input:

There are multiple test cases! On the first line of each test case, there are two integers n (0<n<=1,000) and m (0<=m<=10,000). On the second line, there are n integers C1···Cn. Then m lines follow, each line has three integers i, j, k (0<i<=j<=n, 0<=k<2^31), meaning that the total number of soldiers from the ith camp to the jth camp is at least k.

Output:

For each test case, output one integer in a single line: the least number of all soldiers in Liu Bei's army from Lu Xun's observation. However, Lu Xun's estimations given in the input data may be very unprecise. If his estimations cannot be true, output "Bad Estimations" in a single line instead.

Sample Input:

3 2
1000 2000 1000
1 2 1100
2 3 1300
3 1
100 200 300
2 3 600

Sample Output:

1300
Bad Estimations

题意：n个帐篷，m个描述，下面n个值代表每个帐篷最多能容多少人.下面m行表示区间[a,b]内最少有c人，问总共最少有多少人.

思路：一个很好的差分约束，让我又去认真翻看了某巨的讲解，从头到尾，醍醐灌顶.附链接

相当于给定m个不等式，以及题目隐藏不等式，用最短(长)路求出结果.

mark:题目有可能给出各种各样的不等式，需要求最小值化为>= 求最长路，求最大值则化为<= 求最短路.

这个题出现正权回路就说明无答案，当然也可以用前缀和的方式判断是否有答案.

代码：

#include<bits/stdc++.h>
#define mem(a,b) memset(a,b,sizeof(a))
#define mod 1000000007
using namespace std;
typedef long long ll;
const int maxn = 1e5+5;
const double esp = 1e-7;
const int ff = 0x3f3f3f3f;
map<int,int>::iterator it;

struct node
{
	int u;
	ll w;
	int v;
	int ne;
} r[maxn];

int n,m,len;
int head[maxn],vis[maxn],d[maxn];
ll dis[maxn];

void add(int u,int v,ll w)
{
	r[len].u = u;
	r[len].v = v;
	r[len].w = w;
	r[len].ne = head[u];
	head[u] = len++;
}

bool spfa()
{
	queue<int> q;
	q.push(0);
	dis[0] = 0;
	vis[0] = 1;
	d[0]++;
	
	while(!q.empty())
	{
		int pos = q.front();
		q.pop();
		vis[pos] = 0;
		for(int i = head[pos];i!= -1;i = r[i].ne)
		{
			int to = r[i].v;
			if(dis[pos]+r[i].w> dis[to])
			{
				dis[to] = dis[pos]+r[i].w;
				if(!vis[to])
				{
					q.push(to);
					d[to]++;
					
					if(d[to]>= n)
						return 0;
				}
			}
		}
	}
	
	return 1;
}

void init()
{
	len = 0;
	mem(head,-1);
	mem(vis,0);
	mem(d,0);
	mem(dis,-1);
}

int main()
{
	while(~scanf("%d %d",&n,&m))
	{
		init();
		for(int i = 1;i<= n;i++)
		{
			int c;
			scanf("%d",&c);
			add(i,i-1,-c);
			add(i-1,i,0);
		}
		
		for(int i = 1;i<= m;i++)
		{
			int a,b,c;
			scanf("%d %d %d",&a,&b,&c);
			add(a-1,b,c);
		}
		
		if(spfa())
			printf("%lld\n",dis[n]);
		else
			printf("Bad Estimations\n");
	}
	
	return 0;
}