K - Candies （（最短路+差分约束））

滴答滴答---题目链接 

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 integers N and M not exceeding 30 000 and 150 000 respectively. N is the number of kids in the class and the kids were numbered 1 through N. snoopy and flymouse were always numbered 1 and N. Then follow M lines each holding three integers A, B and cin order, meaning that kid A believed that kid B should never get over c 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 2
1 2 5
2 1 4

Sample Output

5

Hint

32-bit signed integer type is capable of doing all arithmetic.

题目大意：给N个小屁孩分糖果，每个小屁孩都有一个期望，比如A最多比B多C个，再多了就不行了，会打架的，求N最多比1多几块糖

分析：就是求一个极小极大值...试试看

这里需要用到一个查分约束的东西

下面是查分约束详解：

一直不知道差分约束是什么类型题目，最近在写最短路问题就顺带看了下，原来就是给出一些形如x-y<=b不等式的约束，问你是否满足有解的问题

好神奇的是这类问题竟然可以转换成图论里的最短路径问题，下面开始详细介绍下

比如给出三个不等式,b-a<=k1,c-b<=k2,c-a<=k3,求出c-a的最大值,我们可以把a,b,c转换成三个点，k1，k2，k3是边上的权，如图

 

由题我们可以得知，这个有向图中，由题b-a<=k1,c-b<=k2,得出c-a<=k1+k2,因此比较k1+k2和k3的大小，求出最小的就是c-a的最大值了

根据以上的解法，我们可能会猜到求解过程实际就是求从a到c的最短路径，没错的....简单的说就是从a到c沿着某条路径后把所有权值和k求出就是c -a<=k的一个

推广的不等式约束，既然这样，满足题目的肯定是最小的k，也就是从a到c最短距离...

理解了这里之后，想做题还是比较有困难的，因为题目需要变形一下，不能单纯的算..

首先以poj3159为例,这个比较简单，就是给出两个点的最大差，然后让你求1到n的最大差，直接建图后用bellman或者spfa就可以过了

稍微难点的就是poj1364，因为他给出的不等式不是x-y<=k形式，有时候是大于号，这样需要我们去变形一下，并且给出的还是>,<没有等于，都要变形

再有就是poj1201，他要求出的是最长距离，那就要把形式变换成x-y>=k的标准形式

注意点:

1. 如果要求最大值想办法把每个不等式变为标准x-y<=k的形式,然后建立一条从y到x权值为k的边,变得时候注意x-y<k =>x-y<=k-1

如果要求最小值的话,变为x-y>=k的标准形式，然后建立一条从y到x的k边，求出最长路径即可

2.如果权值为正，用dj，spfa，bellman都可以，如果为负不能用dj，并且需要判断是否有负环，有的话就不存在

 

 

/

队列会超时死，用栈就会过.....不要问为什么。。。。。。。为什么。。什么。。。么。。

#include <iostream>
#include<stdio.h>
#include<string.h>
#include<stack>
using namespace std;
const int inf=0x3f3f3f;
const int N=30005;
struct st
{
    int u,v,c,next;
} e[N*10];
int head[N],dis[N];
int vis[N];
void add(int u,int v,int c,int k)
{
    e[k].u=u;
    e[k].v=v;
    e[k].c=c;
    e[k].next=head[u];
    head[u]=k;
}
void spfa()
{
    stack<int>s;
    s.push(1);
    while(s.size())
    {
        int i=s.top();
        s.pop();
        vis[i]=0;
        for(int j=head[i]; j!=0; j=e[j].next)
        {
            int u=e[j].u,v=e[j].v,c=e[j].c;
            if(dis[v]>dis[u]+c)
            {
                dis[v]=dis[u]+c;
                if(vis[v]==0)
                {
                    vis[v]=1;
                    s.push(v);
                }
            }
        }
    }

}
int main()
{
    int n,m;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        int u,v,c;
        for(int i=1; i<=n; i++)
        {
            dis[i]=inf,head[i]=0;
        }
        dis[1]=0;
        for(int i=1; i<=m; i++)
        {
            scanf("%d%d%d",&u,&v,&c);
            add(u,v,c,i);
        }
        spfa();
        printf("%d\n",dis[n]);
    }

    return 0;
}