POJ3159::SPFA
来源:互联网 发布:无忧商务推广软件 编辑:程序博客网 时间:2024/05/29 11:57
Description
During the kindergarten days, flymouse was the monitor of his class. Occasionally the head-teacher brought the kids of flymouse’s class a large bag of candies and had flymouse distribute them. All the kids loved candies very much and often compared the numbers of candies they got with others. A kid A could had the idea that though it might be the case that another kid B was better than him in some aspect and therefore had a reason for deserving more candies than he did, he should never get a certain number of candies fewer than B did no matter how many candies he actually got, otherwise he would feel dissatisfied and go to the head-teacher to complain about flymouse’s biased distribution.
snoopy shared class with flymouse at that time. flymouse always compared the number of his candies with that of snoopy’s. He wanted to make the difference between the numbers as large as possible while keeping every kid satisfied. Now he had just got another bag of candies from the head-teacher, what was the largest difference he could make out of it?
Input
The input contains a single test cases. The test cases starts with a line with two integersN andM not exceeding 30 000 and 150 000 respectively.N is the number of kids in the class and the kids were numbered 1 throughN. snoopy and flymouse were always numbered 1 andN. Then followM lines each holding three integersA,B and c in order, meaning that kidA believed that kidB should never get overc candies more than he did.
Output
Output one line with only the largest difference desired. The difference is guaranteed to be finite.
Sample Input
2 21 2 52 1 4
Sample Output
5
Hint
Source
/*给定n个糖果,m个条件,和两个糖果a,b之间,w[a]-w[b]的最大差,即w[a]-w[b]<=c求1到n之间的最大差。将两个糖果之间的关系看有向边,差看作权值,然后建边,用SPFA即可参考http://www.cnblogs.com/kuangbin/archive/2012/08/17/2644685.html2017,11,4*/#include <iostream>#include <cstdio>#include <cstring>using namespace std;const int INF = 0x3f3f3f3f;int n,m;struct node{ int to; int val; int nex;};node edge[150005];int cnt;int head[30005];int dis[30005];bool vis[30005];int q[30005];inline void AddEdge(int u,int v,int w){ cnt++; edge[cnt].to = v; edge[cnt].val = w; edge[cnt].nex = head[u]; head[u] = cnt; return;}void SPFA(){ memset(dis,INF,sizeof(dis)); int top = 1; q[top] = 1; vis[1] = 1; dis[1] = 0; while(top != 0) { int now = q[top]; top--; vis[now] = false; for(int i = head[now]; i != -1; i = edge[i].nex) { int nxt = edge[i].to; if(dis[nxt] > dis[now] + edge[i].val) { dis[nxt] = dis[now] + edge[i].val; if(!vis[nxt]) { vis[nxt] = true; top++; q[top] = nxt;// top++; } } } }}int main(){ memset(head,-1,sizeof(head)); scanf("%d%d",&n,&m); for(int i=1;i<=m;i++) { int u,v,w; scanf("%d%d%d",&u,&v,&w); AddEdge(u,v,w); } SPFA(); printf("%d",dis[n]);}
- POJ3159::SPFA
- poj3159(spfa+栈)
- poj3159 Candies(SPFA+stack)
- poj3159(spfa)
- spfa+队列+邻接表POJ3159
- spfa+栈+邻接表模板POJ3159
- POJ3159差分约束(SPFA)
- poj3159-Candies差分约束-spfa+栈
- poj3159
- poj3159
- poj3159
- [poj3159]
- 【spfa(栈)或者 堆优dijkstra】poj3159
- poj3159 Candies 差分约束+spfa+模拟stack
- SPFA最短路 建图模板 POJ1511&&POJ3159
- POJ3159 Candies(最短路径:SPFA+链表+栈)
- poj3159——Candies(差分约束+SPFA堆栈)
- POJ3159 Candies(差分约束+SPFA的栈实现)
- netty源码学习三(channel、channelHandler、channelPipeline)
- Fluent Python读书笔记(一)
- Java中List集合去除重复数据的方法
- Net-snmp总结(二)-net-snmp配置编译安装
- IntelliJ IDEA控制台Console里没有查找快捷键
- POJ3159::SPFA
- 优秀的程序员是怎样炼成的
- kill (二分 贪心)
- 数字三角形
- servlet中请求转发(forword)与重定向(sendredirect)的区别
- 除了tomcat还有jetty
- Host SMBus controller not enabled的解决方法
- 算法分析与设计课程作业第八周#1
- 选最大值 最小值 平均值