原题:http://poj.org/problem?id=3160
题意:给你一个有n个点,m条有向边的图,以及每个点的权值;
问遍历一遍图能得到的最大权值;
每次经过一个点时,可以选择是否获取该点的权值,但只能获取一次;
起点任意;
思路:将环缩点,每个强连通分量的权值为该连通块中所有正点权值和;
得到一个有向无环图,然后建立一个虚根,将所有入度为0的点跟虚根相连;
最后用spfa求最大点权;
#include<stdio.h>
#include<string.h>
#include<vector>
#include<queue>
#include<iostream>
#include<algorithm>
using namespace std;
#define inf 999999999;
const int N = 30005;
const int M = 150005;
int belong[N], DFN[N], low[N], stack[N];
bool vis[N];
int a[N], head[N], val[N];
int edgenum, top, time, taj;
int n, m;
vector<int>bcc[N];
struct node
{
int from, to, nex;
bool sign;
}edge[M];
void add(int u, int v)
{
edge[edgenum].from = u;
edge[edgenum].sign = false;
edge[edgenum].to = v;
edge[edgenum].nex = head[u];
head[u] = edgenum++;
}
void tarjan(int u ,int fa)
{
DFN[u] = low[u] = time++;
stack[top++] = u;
vis[u] = 1;
for(int i = head[u];i!=-1;i = edge[i].nex )
{
int v = edge[i].to;
if(DFN[v] == -1)
{
tarjan(v , u) ;
low[u] = min(low[u], low[v]) ;
if(DFN[u] < low[v])
edge[i].sign = 1;
}
else if(vis[v])
low[u] = min(low[u], DFN[v]);
}
if(low[u] == DFN[u])
{
taj++;
val[taj] = 0;
bcc[taj].clear();
while(1)
{
int now = stack[--top];
vis[now] = 0;
belong[now] = taj;
if(a[now] > 0)
val[taj]+=a[now];
bcc[taj].push_back(now);
if(now == u)
break;
}
}
}
vector<int>G[N];
int du[N];
void suodian()
{
memset(du, 0, sizeof(du));
for(int i = 1;i<=taj;i++)
G[i].clear();
for(int i = 0;i<edgenum;i++)
{
int u = belong[edge[i].from];
int v = belong[edge[i].to];
if(u!=v)
{
G[u].push_back(v);
du[v]++;
}
}
}
int b[N];
int spfa()
{
queue<int>q;
G[0].clear();
q.push(0);
b[0] = 0;
val[0] = 0;
for(int i = 1;i<=taj;i++)
{
if(du[i] == 0)
G[0].push_back(i);
b[i] = -inf;
}
int ans = 0;
while(!q.empty())
{
int x = q.front();
q.pop();
for(int i = 0;i<G[x].size();i++)
{
int v = G[x][i];
if(b[v]<b[x]+val[v])
{
b[v] = b[x]+val[v];
ans = max(ans, b[v]);
q.push(v);
}
}
}
return ans;
}
void tarjan_init(int all)
{
memset(DFN, -1, sizeof(DFN));
memset(low, -1, sizeof(low));
memset(vis, 0, sizeof(vis));
time = top = taj = 0;
for(int i = 0;i<all;i++)
{
if(DFN[i] == -1)
tarjan(i, i);
}
}
int main()
{
while(scanf("%d%d", &n, &m)!=EOF)
{
memset(head, -1, sizeof(head));
edgenum = 0;
for(int i = 0;i<n;i++)
scanf("%d", &a[i]);
for(int i = 1;i<=m;i++)
{
int u, v;
scanf("%d%d", &u, &v);
add(u, v);
}
tarjan_init(n);
suodian();
printf("%d\n", spfa());
}
return 0;
}