m0_53916335的博客

题目链接Machine Schedule代码如下#include<bits/stdc++.h>using namespace std;const int M = 510;int k,m,n;int g[M][M],link[M];bool vis[M];bool dfs(int u){ for(int v = 0;v<n;v++) if(g[u][v]&&!vis[v]){ vis[v] = true; if(link[v]==-1||df

题目链接过山车代码如下#include<bits/stdc++.h>using namespace std;const int M = 502;int k,m,n;int g[2*M][2*M],link[M];bool vis[M];bool dfs(int u){ for(int v = 1;v<=n;v++) if(g[u][v]&&!vis[v]){ vis[v] = true; if(link[v]==-1||dfs(link[v