题意:
给你一个有向图,让你求整个图可以跑出的最长路。
思路:
对每个入度为0的点跑一遍最短路,每次跑都记忆化。最后遍历一遍最大值。
spfa代码:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxm = 1e5+7;
const int maxn = 1e4+7;
struct edge
{
int to,val,next;
}e[maxm];
int vis[maxn],head[maxn],in[maxn];
ll dis[maxn];
int n,m,cnt;
void add(int u,int v,int val)
{
e[cnt] = (edge){v,val,head[u]};
head[u] = cnt++;
}
void spfa(int a)
{
queue<int> q;
q.push(a);
while(!q.empty())
{
int u = q.front();
q.pop();
vis[u] = 0;
for(int i = head[u];i!=-1;i=e[i].next)
{
int v = e[i].to;
if(dis[v]<dis[u]+e[i].val)
{
dis[v] = dis[u]+e[i].val;
if(!vis[v])
{
q.push(v);
vis[v] = 1;
}
}
}
}
}
int main()
{
int t;
cin>>t;
memset(vis,0,sizeof(vis));
while(t--)
{
cnt = 0;
scanf("%d%d",&n,&m);
//cout<<n<<m<<endl;
for(int i = 1;i<=n;i++)
head[i] = -1,in[i] = 0,dis[i] = 0;
for(int i = 0;i<m;i++)
{
int u,v,val;
scanf("%d%d%d",&u,&v,&val);
add(max(u,v),min(u,v),val);
//cout<<i<<endl;
in[min(u,v)]++;
}
ll maxx = 0;
for(int i = 1;i<=n;i++)
if(in[i]==0)
{
spfa(i);
}
for(int i = 1;i<=n;i++)
maxx = max(maxx,dis[i]);
printf("%lld\n",maxx);
}
return 0;
}
bellman代码:正常的会超时,用判类似判负环的方法优化一下
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,int> pii;
const int maxm = 1e5+7;
const int maxn = 1e4+7;
const ll inf = 0x3f3f3f3f3f3f3f3f;
struct Edge{
int u, v;
ll val;
Edge(int u = 0,int v = 0,ll val = 0):u(u), v(v), val(val){}
};
vector<Edge>edges;
vector<int>g[maxn];
void add(int u,int v,ll val){
edges.push_back(Edge(u,v,val));
//g[u].push_back((int)edges.size()-1);
}
int n,m,in[maxn];
ll dis[maxn];
void bellman()
{
for(int i = 1;i<=n;i++)
if(in[i] == 0)
dis[i] = 0;
bool flag = false;
while(true)
{
flag = false;
for(int j = 0;j<edges.size();j++)
{
if(dis[edges[j].v]<dis[edges[j].u]+edges[j].val)
dis[edges[j].v] = dis[edges[j].u]+edges[j].val,flag = true;
}
if(!flag)
break;
}
}
int main()
{
int t;
cin>>t;
while(t--)
{
edges.clear();
scanf("%d%d",&n,&m);
//cout<<n<<m<<endl;
for(int i = 1;i<=n;i++)
in[i] = 0,dis[i] = -inf;
for(int i = 0;i<m;i++)
{
int u,v,val;
scanf("%d%d%d",&u,&v,&val);
add(u,v,val);
//cout<<i<<endl;
in[v]++;
}
bellman();
ll maxx = 0;
for(int i = 1;i<=n;i++)
maxx = max(maxx,dis[i]);
printf("%lld\n",maxx);
}
return 0;
}