拓扑排序:[USACO20FEB]Timeline G

题目链接:点击这里

#include<cstdio>
#include<iostream>
#include<cstring>
#include<queue>
#include<algorithm>
typedef long long ll;
typedef long double ld;
using namespace std;
const int maxn=1e5+5;
const int maxm=2e5+5;
ll in[maxn],head[maxn],num=0,ans=0,out[maxn],s[maxn],dp[maxn];
struct node{
	ll next,to,len;
}kkk[maxm];
void addedge(ll u,ll v,ll w){
	kkk[++num].next=head[u];
	kkk[num].to=v;
	kkk[num].len=w;
	head[u]=num;
}
int main()
{	
	ll n,m,c;
	scanf("%lld%lld%lld",&n,&m,&c);
	for(ll i=1;i<=n;++i) scanf("%lld",&s[i]);
	for(ll i=0;i<c;++i){
		ll u,v,w;
		scanf("%lld%lld%lld",&u,&v,&w);
		addedge(u,v,w);
		++out[u],++in[v];
	}
	for(ll i=1;i<=n;++i){
		addedge(0,i,s[i]);
		++out[0],++in[i];
	}
	memset(dp,0,sizeof(dp));
	queue<ll>q;
	q.push(0);
	while(!q.empty()){
		ll u=q.front();q.pop();
		for(ll i=head[u];i;i=kkk[i].next){
			ll v=kkk[i].to;
			if(dp[u]+kkk[i].len>dp[v]) dp[v]=dp[u]+kkk[i].len;
			//printf("%lld %lld %lld %lld\n",u,u,dp[u],kkk[i].len);
			--in[v];
			if(!in[v]) q.push(v);
		}
	}
	for(ll i=1;i<=n;++i){
		printf("%lld\n",dp[i]);
	}
    return 0;
}