ZOJ - 2770 差分约束

最新推荐文章于 2018-11-11 22:52:50 发布

jerans

最新推荐文章于 2018-11-11 22:52:50 发布

阅读量337

点赞数

分类专栏：最短路

本文链接：https://blog.csdn.net/jerans/article/details/79935348

版权

最短路专栏收录该内容

3 篇文章

订阅专栏

题意：n个军营，给出每个军营的最大人数，m个估计，表示一段区间内的军营的最少人数和，现在让你求所有军营的最小可能人数和

利用前缀和构造不等式关系，形成差分约束系统，其实就是跑一遍最短路就可以了

#include<bits/stdc++.h>
#define inf  0x3f3f3f3f3f3f3f3f
using namespace std;
const int maxn = 2000;
struct node{
	int ne;
	long long cost;
	node(int u, long long v){
		ne = u;
		cost = v;
	}
	node(){
	}
};
vector<node>w[maxn];
long long dis[maxn], s[maxn];
int book[maxn], cnt[maxn], n, a[maxn];
int SPFA(){
	for(int i = 0; i <= n; i++){
		book[i] = 0, cnt[i] = 0, dis[i] = -inf;
	}
	queue<int>Q;
	Q.push(0);
	dis[0] = 0;
	book[0] = cnt[0] = 1;
	while(!Q.empty()){
		int pre = Q.front();
		book[pre] = 0; Q.pop();
	//	cout << pre << " " << dis[pre] << endl;
		for(int i = 0; i < w[pre].size(); i++){
			if(dis[pre] + w[pre][i].cost > dis[w[pre][i].ne]){
				dis[w[pre][i].ne] = dis[pre] + w[pre][i].cost;
				if(!book[w[pre][i].ne]){
					book[w[pre][i].ne] = 1;
					Q.push(w[pre][i].ne);
				}
			}
		}
	}
	return dis[n];
}
int main(){
	int m, u, v, cost;
	while(cin >> n >> m){
		int flog = 0;
		for(int i = 0; i <= n; i++){
			w[i].clear();
			s[i] = 0;
		}
		for(int i = 1; i <= n; i++){
			scanf("%d", &a[i]);
			s[i] = s[i - 1] + a[i];
			w[i].push_back(node(i - 1, -a[i]));
			w[i - 1].push_back(node(i, 0));
		} 
		while(m--){
			scanf("%d %d %d", &u, &v, &cost);
			if(cost > s[v] - s[u - 1])
			flog = 1;
			w[u - 1].push_back(node(v, cost));
		}
		if(flog)
		cout << "Bad Estimations" << endl;
		else
		cout << SPFA() << endl;
	}
	return 0;
}