Burn the Linked Camp(bellman 差分约束系统)

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

注意dij只能处理非负权值的最短路问题，   所以差分约束系统一律用   bellman()
注意：本题应该是用spfa做的，不然bellman   O(nm)算法很容易超时，     但此题不但没有超时，竟然能在100ms的时间内通过。

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <cmath>
 #include <algorithm>
 #include <string>
 #include <vector>
 #include <set>
 #include <map>
 #include <queue>
 #include <stack>
 #include <sstream>
 #include <iomanip>
 using namespace std;
 const int INF=0x4fffffff;
 const int EXP=1e-;
 const int MS=;

 struct edge
 {
       int u,v,w;
 }edges[*MS];

 int n,m,esize;
 int dis[MS];
 int C[MS];
 int maxv[MS];

 int input()
 {
       if(scanf("%d%d",&n,&m)==EOF)
             return ;
    /*
                   c[i]>=s[i]-s[i-1]>=0;
 　　　　　　maxv[v]-maxv[u-1]>=s[v]-s[u-1]>=w;
 　　　　　　四个约束条件
       */
       //因为  s[n]-s[i]>=0;   ==>    s[i]<=s[n]+0,   n->i     w=0;
       //   所以dis初始化为  0;
       memset(dis,,sizeof(dis));
       memset(maxv,,sizeof(maxv));
       esize=;
       for(int i=;i<=n;i++)
       {
             scanf("%d",&C[i]);
             maxv[i]=C[i]+maxv[i-];
             edges[esize].u=i-;
             edges[esize].v=i;
             edges[esize++].w=C[i];

             edges[esize].u=i;
             edges[esize].v=i-;
             edges[esize++].w=;
       }
       int u,v,w;
       for(int i=;i<m;i++)
       {
             scanf("%d%d%d",&u,&v,&w);
             edges[esize].u=v;
             edges[esize].v=u-;
             edges[esize++].w=-w;

             edges[esize].u=u-;
             edges[esize].v=v;
             edges[esize++].w=maxv[v]-maxv[u-];
       }
       return ;
 }

 bool bellman()
 {
       for(int i=;i<=n;i++)      //千万注意定点个数是n+1,不然会错。
       {
             for(int j=;j<esize;j++)
             {
                   if(dis[edges[j].u]+edges[j].w<dis[edges[j].v])
                   {
                         dis[edges[j].v]=dis[edges[j].u]+edges[j].w;
                         if(i==n)
                               return false;
                   }
             }
       }
       return true;
 }

 int main()
 {
       while(input())
       {
             if(bellman())
                   printf("%d\n",dis[n]-dis[]);
             else
                   printf("Bad Estimations\n");
       }
       return ;
 }