BZOJ1179&&洛谷P3627 [APIO2009]抢掠计划

很显然一个点可以去若干次的意思就是你可以把一个环抢完，那么肯定是要缩点，缩完点之后，显然就是单源最长路呗，拓扑排序或spfa乱搞就ok了，没啥难度

代码

//By AcerMo
#include<cmath>
#include<stack>
#include<queue>
#include<cstdio>
#include<vector>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int M=500500;
bool jud[M];
int n,m,ind,ti,w[M],c[M],st,e;
int dfn[M],low[M],vis[M],fa[M],ono[M],dis[M];
stack<int>s;
vector<int>v[M];
vector<int>g[M];
inline int read()
{
	int x=0;char ch=getchar();
	while (ch>'9'||ch<'0') ch=getchar();
	while (ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
	return x;
}
inline void tarjan(int x)
{
	low[x]=dfn[x]=++ind;vis[x]=1;s.push(x);
	for (int i=0;i<v[x].size();i++)
	{
		int to=v[x][i];
		if (!dfn[to])
			tarjan(to),low[x]=min(low[x],low[to]);
		else if (vis[to])
			low[x]=min(low[x],dfn[to]);
	}
	if (low[x]==dfn[x])
	{
		int u=-1;ti++;
		while (u!=x)
		{
			u=s.top();s.pop();
			fa[u]=ti;vis[u]=0;
		}
	}
	return ;
} 
inline void spfa()
{
	queue<int>q;q.push(fa[st]);dis[fa[st]]=w[fa[st]];
	while (q.size())
	{
		int u=q.front();ono[u]=0;q.pop();
		for (int i=0;i<g[u].size();i++)
		{
			int to=g[u][i];
			if (dis[to]<dis[u]+w[to]) 
			{
				dis[to]=dis[u]+w[to];
				if (!ono[to]) ono[to]=1,q.push(to);
			}
		}
	}
	return ;
}
signed main()
{
	n=read();m=read();
	for (int i=1;i<=m;i++)
	{
		int x=read(),y=read();
		v[x].push_back(y);
	}
	for (int i=1;i<=n;i++) c[i]=read();
	for (int i=1;i<=n;i++)
	if (!dfn[i]) tarjan(i);
	for (int i=1;i<=n;i++) w[fa[i]]+=c[i];
	for (int i=1;i<=n;i++)
	for (int k=0;k<v[i].size();k++)
	if (fa[i]!=fa[v[i][k]]) g[fa[i]].push_back(fa[v[i][k]]);
	st=read();e=read();
	for (int i=1;i<=e;i++)
	{
		int x=read();jud[fa[x]]=1;
	}
	spfa();int ans=0;
	for (int i=1;i<=ti;i++) if (jud[i]) ans=max(ans,dis[i]);
	cout<<ans;
	return 0;
}