hdu1531差分约束系统

题意：求一组不等式是否有解，这些不等式要么是Xa+X(a+1)+.......+Xb<k要么是Xa+X(a+1)+.......+Xb>k

令Ti=X(0)+....X(i-1),则不等式变为Tb-T(a-1)<k,进而得到Tb-T(a-1)<=k-1.

注意的是：<=是求最短路，>=是求最长路

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int oo=1e8;
const int mn=12100;
const int mm=14400;
int edge,n,m;
int ver[mm],next[mm],cost[mm];
int head[mn],dis[mn],q[mn],vis[mn],outdegree[mn];
void addedge(int u,int v,int c)
{
    ver[edge]=v,cost[edge]=c,next[edge]=head[u],head[u]=edge++;
}
bool spfa()
{
    int i,u,v,l,r=0,tmp;
    for(i=0;i<=n+1;i++) dis[i]=oo,vis[i]=0,outdegree[i]=0;
    dis[q[r++]=n+1]=0;
    for(l=0;l!=r;(++l>mn)?l=0:l)
        for(i=head[u=q[l]],vis[u]=0;i>=0;i=next[i])
            if(dis[v=ver[i]]>(tmp=dis[u]+cost[i]))
            {
                dis[v]=tmp;
               // cout<<"u="<<u<<" v="<<v<<endl;
                if(vis[v])  continue;
                if(++outdegree[v]>(n+1))    return false;//因为加了一个n+1，所以一共有n+1个点
                vis[q[r++]=v]=1;
                //cout<<"l="<<l<<endl;
                if(r>=mn)   r=0;
            }
    return true;
}
int main()
{
    int i,j,a,b,c;
    char ch[10];
    while(scanf("%d",&n)!=EOF)
    {
        if(n==0)    break;
        scanf("%d",&m);
        edge=0;
        memset(head,-1,sizeof(head));
        for(i=0;i<m;i++)
        {
            scanf("%d%d%s%d",&a,&b,ch,&c);
            if(ch[0]=='g')
            {
                addedge(a+b,a-1,-c-1);
                //cout<<a+b<<" "<<a-1<<" "<<-c-1<<endl;
            }
            else
            {
                addedge(a-1,a+b,c-1);
                //cout<<a-1<<" "<<a+b<<" "<<c-1<<endl;
            }
        }
        for(i=0;i<=n;i++)
            addedge(n+1,i,1);
        if(spfa())  puts("lamentable kingdom");
        else    puts("successful conspiracy");
    }
    return 0;
}