CF 712C Journey(dp+graph)

点击打开链接

#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#define fi first
#define se second 
using namespace std;
const int N=5005;
typedef long long ll;
typedef pair<int,ll> ii;//顶点和距离 
int n,m,T; 
const ll inf=(ll)1e9;
struct Edge{
	int from,to;
	int cost;
}e[N];
int sz=0;
int path[N];

//要求:经过的城市尽量多&&花费不超过T 
int dp[N][N];//dp[i][j] 到达j时经历了i个点的最小花费 
//dp[i][j]=min(dp[i-1][v]+cost(v,j),dp[i][j])

int par[N][N];//经过i个节点到达j的前驱 

void print()
{
	int ans;
	for(int i=n;i>=1;i--)
	{
		if(dp[i][n]<=T)
		{
			ans=i;
			break;
		}
	}
	cout<<ans<<endl;
	int cur=n,k=ans;
	int i=1;
	path[i]=n;
	
	while(i<ans)
	{
		cur=par[k--][cur];
		path[++i]=cur;
	}
	for(int j=i;j>=1;j--)
	{
		cout<<path[j];
		if(j==1)
		cout<<endl;
		else
		cout<<" "; 
	}	
}
int main()
{
	cin>>n>>m>>T;
	for(int i=1;i<=m;i++)
	{
		int u,v,w;
		cin>>u>>v>>w;
		e[i].from=u;
		e[i].to=v;
		e[i].cost=w; 
		sz++;
	}
	memset(dp,0x3f3f3f3f,sizeof(dp));
	dp[1][1]=0;  


	for(int i=2;i<=n;i++)//经历i个顶点到达j 
	{
		for(int k=1;k<=sz;k++)//边集 
		{
			int u=e[k].from;
			int v=e[k].to;
			int w=e[k].cost;
			if(dp[i][v]>dp[i-1][u]+w)
			{
				dp[i][v]=dp[i-1][u]+w;
				par[i][v]=u;//保存路径 
			}
		}
	}
	print();
	return 0;
}