喵头鹰的博客

#include <iostream>#include <cstdio>#include <cstring>#include <vector>using namespace std;const int MAX_V = 205;vector<int> G[MAX_V]; // 图int V; // 顶点数int color[MAX_V]; //

#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>const int maxn=110;const int INF=0x3f3f3f3f;using namespace std;struct edge{ int to,w,next;} edge[maxn];bool vis[ma

#include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <algorithm>const int maxn=1e5+10;using namespace std;int f[maxn];void init(int n){ for(int i=1; i<=n; i++) f[i

#include <stdio.h>#include <string.h>#include <iostream>#include <algorithm>#include <queue>using namespace std;const int maxn=30;int head[maxn],ip,indegree[maxn];int n,m,seq[maxn];struct note{