- 博客(37)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 hdu 2181 哈密顿绕行世界问题
#include<bits/stdc++.h>using namespace std;int g[50][50],ans,use[25],n,v[25];void dfs(int st,int cnt){ //printf("%d\n",cnt); if(cnt==20&&st==n) { ans++; printf("%d: ",ans
2015-11-30 19:29:11
329
原创 hdu 1238 Substrings 字符串暴力
#include<bits/stdc++.h>using namespace std;char s[120][120],s1[120],s2[120];int main(){ int _,n,f,i,j,k,len,fl,flag; scanf("%d",&_); while(_--) { scanf("%d",&n); fl=15
2015-11-27 15:51:54
282
原创 hdu 2063 过山车 二分匹配+hk算法
#include <stdio.h>#include <string.h>#include <iostream>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <set>#include <map>#include <string>#include <math.h>#in
2015-11-26 22:40:52
356
原创 poj 2112 Optimal Milking 二分图多重匹配
#include<stdio.h>#include<string.h>#include<queue>#include<vector>#include<map>#include<iostream>using namespace std;const int N=1024*10;const int inf=10000000;struct Edge{ int from,to,cap
2015-11-26 22:00:58
282
原创 poj 3189 Steady Cow Assignment 二分图多重匹配
#include<stdio.h>#include<string.h>#include<queue>#include<vector>using namespace std;const int N=1200;const int inf=1<<24;struct Edge{ int from,to,cap,flow;};vector<Edge>edges;vector<int
2015-11-26 19:29:08
269
原创 hdu 3488 Tour km二分匹配最小权
#include<stdio.h>#include<string.h>#include<queue>#include<vector>using namespace std;const int N=1024;const int inf=100000000;int n,m,w[N][N],aug,mat[N],lx[N],ly[N];int visx[N],visy[N],slack[N]
2015-11-26 18:23:28
418
原创 hdu 5294 Tricks Device spfa+网络流
题目要求两个答案，先求第二个答案，用spfa跑两次，第一次以1为起点，记录一下到终点最短距离通过了几条边。第二次以2为起点，跑一下。第一问题为最小移去多少条边，图不连通，题目中只需要移动最短路上的边，所以根据前两次spfa的结果，将最短路上的边找出来，流量记为1构成一张新图，转化为网络流问题，汇点的流量就是答案。#include<stdio.h>#include<algorithm>#inclu
2015-11-26 08:41:22
286
原创 poj 2289 Jamie's Contact Groups 二分图多重匹配
#include<stdio.h>#include<string.h>#include<queue>#include<vector>using namespace std;const int N=2048;const int inf=1<<24;struct Edge{ int from,to,cap,flow;};vector<Edge>edges;vector<int
2015-11-23 13:15:22
605
原创 hdu 2255 奔小康赚大钱 二分权值最大匹配
#include<stdio.h>#include<string.h>#include<queue>#include<vector>using namespace std;const int N=1024;const int inf=100000000;int n,m,w[N][N],aug,mat[N],lx[N],ly[N];int visx[N],visy[N],slack[N]
2015-11-22 21:27:58
265
原创 hdu 3829 Cat VS Dog 二分匹配
#include <stdio.h>#include <string.h>#include <iostream>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <set>#include <map>#include <string>#include <math.h>#in
2015-11-21 17:01:11
296
原创 [kuangbin带你飞]专题九 连通图题解报告-差1题
poj1236 Network of Schools先用tarjan计算强连通分量缩点统计缩点后的点的入度和出度A问的是最少需要发布多少份，即入度为0的点有几个B问的是最少添加几条边可以使只有一个强连通分量，即统计出度为0的点的个数，如果A大于B，输出两个Auva796 Critical Links题意：给你一张图，问有多少割边输入数据格式比较特殊，例如：0 (1) 1。所以采用下面这
2015-11-20 20:36:11
415
原创 poj 3020 Antenna Placement 二分匹配
#include <stdio.h>#include <string.h>#include <iostream>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <set>#include <map>#include <string>#include <math.h>#in
2015-11-20 20:22:28
307
原创 poj 2594 Treasure Exploration 二分匹配
#include <stdio.h>#include <string.h>#include <iostream>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <set>#include <map>#include <string>#include <math.h>#in
2015-11-20 19:54:46
316
原创 hdu 1054 Strategic Game 最小点覆盖集
“`cppinclude include include include include include include include include include include include include
2015-11-20 16:26:33
317
原创 hdu 1151 Air Raid 匹配
#include <stdio.h>#include <string.h>#include <iostream>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <set>#include <map>#include <string>#include <math.h>#in
2015-11-20 16:01:33
342
原创 hdu 4185 Oil Skimming 二分匹配
#include <stdio.h>#include <string.h>#include <iostream>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <set>#include <map>#include <string>#include <math.h>#in
2015-11-20 15:08:26
391
原创 uvalive 3989 Ladies' Choice 稳定婚姻问题
#include <stdio.h>#include <string.h>#include <iostream>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <set>#include <map>#include <string>#include <math.h>#in
2015-11-20 10:41:37
562
原创 hihocoder 1252 Kejin Game dinic网络流
#include<stdio.h>#include<string.h>#include<queue>#include<vector>using namespace std;const int N=1024;const int inf=1<<24;struct Edge{ int from,to,cap,flow;};vector<Edge>edges;vector<int
2015-11-19 22:12:46
750
原创 poj 2125 Destroying The Graph 最小点权覆盖集
#include<stdio.h>#include<string.h>#include<queue>#include<vector>using namespace std;const int N=1024;const int inf=1<<24;struct Edge{ int from,to,cap,flow;};struct node{ int num,st;
2015-11-18 21:14:52
419
原创 hdu 2389 Rain on your Parade 二分图匹配+HK算法
#include <stdio.h>#include <string.h>#include <iostream>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <set>#include <map>#include <string>#include <math.h>#in
2015-11-17 21:45:43
544
原创 hdu 1281 棋盘游戏 二分匹配
#include <stdio.h>#include <string.h>#include <iostream>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <set>#include <map>#include <string>#include <math.h>#in
2015-11-17 15:19:32
284
原创 hdu 2444 The Accomodation of Students 二分图判定+二分匹配个数
#include <stdio.h>#include <string.h>#include <iostream>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <set>#include <map>#include <string>#include <math.h>#in
2015-11-17 13:27:06
277
原创 poj 3694 Network 连通分量+LCA
#include <stdio.h>#include <string.h>#include <iostream>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <set>#include <map>#include <string>#include <math.h>#in
2015-11-15 16:08:39
344
原创 hdu 4635 Strongly connected
#include <stdio.h>#include <string.h>#include <iostream>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <set>#include <map>#include <string>#include <math.h>#in
2015-11-13 17:15:25
258
原创 hdu 4081 Qin Shi Huang's National Road System 次小生成树
#include<stdio.h>#include<string.h>#include<math.h>#include<algorithm>using namespace std;const int MAXN=1024;const double INF=1e14;int n,vis[MAXN],use[MAXN][MAXN],pre[MAXN];double dist[MAXN],g[
2015-11-13 13:54:24
240
原创 hdu 4612 Warm up 边双连通分量+树的直径
#include <stdio.h>#include <string.h>#include <iostream>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <set>#include <map>#include <string>#include <math.h>#in
2015-11-12 22:59:13
393
原创 hdu 1806 Frequent values rmq+游标编码
白书P198#include<bits/stdc++.h>using namespace std;const int MAXN=100000+5;int a[MAXN],va[MAXN],num[MAXN],L[MAXN],R[MAXN];int d[MAXN][20];void rmq_max(int n){ for(int i=0;i<n;i++) d[i][0]=a[i];
2015-11-12 18:31:31
323
原创 poj 3177 Redundant Paths 强连通+并查集
#include <stdio.h>#include <string.h>#include <iostream>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <set>#include <map>#include <string>#include <math.h>#in
2015-11-10 14:46:53
285
原创 uva 315 Network 割点
//uva 315//割点条件根节点有两个或两个以上节点//或者其他节点u有一个子女w，low[w]>=dfn[u];#include<bits/stdc++.h>using namespace std;const int MAXN=1000+5;struct Edge{ int from,to;};vector<Edge>edges;vector<int>G[MAXN*MA
2015-11-10 13:45:49
491
原创 uva 796 Critical Links 割边的数量
#include <stdio.h>#include <string.h>#include <iostream>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <set>#include <map>#include <string>#include <math.h>#in
2015-11-09 14:55:21
466
原创 zufe oj Problem H: 简单数学题 java
a的b次和c的d次比较大小import java.math.BigInteger;import java.util.Scanner;public class Main { public static void main(String[] args) { // TODO Auto-generated method stub Scanner in=new Scan
2015-11-08 20:15:46
538
原创 poj 2156 Minimum Cost 多次最大流最小费
#include<stdio.h>#include<string.h>#include<vector>#include<queue>#include<algorithm>using namespace std;const int N=8024;const int inf=0x7fffffff;struct Edge{ int from,to,cap,flow,cost;}
2015-11-07 15:08:28
413
原创 uva 10480 Sabotage 最小割最大流定理
#include<stdio.h>#include<string.h>#include<queue>#include<vector>using namespace std;const int N=1024;const int inf=1<<24;int cap[N][N];int flow[N][N];int n,m,s,t;int vis[N];int d[N];int cu
2015-11-06 16:16:26
448
原创 poj 1087 A Plug for UNIX 网络流
#include<stdio.h>#include<string.h>#include<queue>#include<vector>#include<map>#include<iostream>using namespace std;const int N=1024;const int inf=1<<24;struct Edge{ int from,to,cap,flow;
2015-11-06 14:55:30
270
原创 poj 1459 Power Network 网络流
#include<stdio.h>#include<string.h>#include<queue>#include<vector>using namespace std;using namespace std;using namespace std;const int N=1024;const int inf=1<<24;struct Edge{ int from,to,c
2015-11-05 19:26:49
309
原创 hdu 4292 Food 最大流
#include<stdio.h>#include<string.h>#include<queue>#include<vector>using namespace std;const int N=1024;const int inf=1<<24;struct Edge{ int from,to,cap,flow;};vector<Edge>edges;vector<int
2015-11-01 21:06:40
272
原创 hdu 3605 Escape 状态压缩+最大流
#include<stdio.h>#include<string.h>#include<algorithm>#include<iostream>using namespace std;const int MAXN=100010;//点数的最大值const int MAXM=400010;//边数的最大值const int INF=0x3f3f3f3f;struct Node{
2015-11-01 18:46:18
367
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人