数理文章

#include#include#include#include#includeusing namespace std;#define maxe 2000#define maxn 1000struct edge{ int v,next;}E[maxe+10];int head[maxn+10],e;void init(){ memset(head,-1,sizeof(he

#include#include#include#include#define maxn 500#define maxm 500*500/2using namespace std;int T,n,m;struct edge{ int u; int v; int k; bool operator<( const edge & e1 )const{ return k>e1.

void dfs(int u,int pa){ dfn[u]=low[u]=++t; for(int i=0;i<edges[u].size();i++){ int v=edges[u][i]; if(v==pa)continue; if(!low[v]){ dfs(v,u); if(low[v]>=dfn[u])block[u]++; els

#include#include#include#include#include#define maxn 100#define INF 100000000using namespace std;int cap[maxn+10][maxn+10];//容量int flow[maxn+10][maxn+10];//流量int r[maxn+10];//最小残存容量int pa[m

#include#include#include#include#includeusing namespace std;#define maxn 1000#define maxe 1000000#define INF 1000000000struct edge{ int v,r; int next;}E[maxe*4];int head[maxn+10],c;void