bzoj1179 [Apio2009]Atm(tarjan缩点+spfa)

tarjan缩点之后不会有正权圈，跑spfa即可。

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 500010
inline int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*f;
}
int n,m,s,h[N],num=0,w[N],dfn[N],low[N],dfnum=0,bel[N],sw[N],scc=0,h1[N],d[N],ans=0;
bool inq[N];
struct edge{
    int to,next;
}data[N],data1[N];
stack<int>qq;
void tarjan(int x){
    dfn[x]=low[x]=++dfnum;qq.push(x);inq[x]=1;
    for(int i=h[x];i;i=data[i].next){
        int y=data[i].to;
        if(!dfn[y]) tarjan(y),low[x]=min(low[x],low[y]);
        else if(inq[y]) low[x]=min(low[x],dfn[y]);
    }
    if(dfn[x]==low[x]){
        ++scc;sw[scc]=0;while(1){
            int y=qq.top();qq.pop();inq[y]=0;
            bel[y]=scc;sw[scc]+=w[y];if(x==y) break;
        }
    }
}
void rebuild(){
    num=0;
    for(int x=1;x<=n;++x)
        for(int i=h[x];i;i=data[i].next){
            int y=data[i].to;
            if(bel[x]!=bel[y]){
                data1[++num].to=bel[y];data1[num].next=h1[bel[x]];h1[bel[x]]=num;
            }
        }
}
void spfa(){
    deque<int>q;memset(d,0,sizeof(d));
    q.push_back(bel[s]);d[bel[s]]=sw[bel[s]];inq[bel[s]]=1;
    while(!q.empty()){
        int x=q.front();q.pop_front();inq[x]=0;
        for(int i=h1[x];i;i=data1[i].next){
            int y=data1[i].to;
            if(d[x]+sw[y]>d[y]){
                d[y]=d[x]+sw[y];
                if(!inq[y]){
                    if(!q.empty()&&d[y]>d[q.front()]) q.push_front(y);
                    else q.push_back(y);
                }
            }
        }
    }
}
int main(){
//  freopen("a.in","r",stdin);
    n=read();m=read();
    while(m--){
        int x=read(),y=read();data[++num].to=y;data[num].next=h[x];h[x]=num;
    }
    for(int i=1;i<=n;++i) w[i]=read();
    for(int i=1;i<=n;++i) if(!dfn[i]) tarjan(i);rebuild();
    s=read();spfa();m=read();
    while(m--){
        int x=read();if(d[bel[x]]>ans) ans=d[bel[x]];
    }
    printf("%d\n",ans);
    return 0;
}