天下月色共三分的博客

topsort#include<iostream>#include<cstring>#include<algorithm>#include<vector>#include<queue>using namespace std;const int maxn = 1010;int n, m;int a[maxn];bool is[maxn];int g[maxn][maxn];int dis[maxn];int d[maxn]

正向建边+记忆化搜索：不行，因为有环正确思路：反向建边+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[max