正向建边+记忆化搜索:不行,因为有环
正确思路:反向建边+dfs
#include<iostream>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
const int maxn = 1e5 + 10;
int n, m;
int maxres;
vector<int> g[maxn];
int dp[maxn];
bool vi[maxn];
void dfs(int s,int num) {
dp[s] = max(num,dp[s]);
vi[s] = true;
for (int i = 0; i < g[s].size(); i++) {
if(!vi[g[s][i]])
dfs(g[s][i], num);
}
}
int main() {
cin >> n >> m;
memset(dp, -1, sizeof dp);
for (int i = 1; i <= m; i++) {
int x, y;
cin >> x >> y;
g[y].push_back(x);
}
for (int i = n; i >= 1; i--) {
if(!vi[i])
dfs(i,i);
}
for (int i = 1; i <= n; i++)cout << dp[i] << " ";
return 0;
}