2016年05月_martinue

原创 hdu1045（二分图）

Fire NetTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9579 Accepted Submission(s): 5579Problem DescriptionSuppose that we h

2016-05-31 21:08:32 378

原创 hdu1151（二分图最大独立集）

Air RaidTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4575 Accepted Submission(s): 3062Problem DescriptionConsider a town w

2016-05-31 20:18:10 486

原创二分图匈牙利算法模板

最大匹配数：最大匹配的匹配边的数目最小点覆盖数：选取最少的点，使任意一条边至少有一个端点被选择最大独立数：选取最多的点，使任意所选两点均不相连最小路径覆盖数：对于一个 DAG（有向无环图），选取最少条路径，使得每个顶点属于且仅属于一条路径。路径长可以为0（即单个点）。定理1：最大匹配数 = 最小点覆盖数（这是 Konig 定理）定理2：最大匹配数 = 最大独立数定理3：最小

2016-05-31 20:13:57 1482

原创最小费用流模板

和最大流模板对比着看：最大流模板（Dinic）贴上最小费用流模板：const int oo=1e9;const int mm=11111111;const int mn=888888;int node,src,dest,edge;int ver[mm],flow[mm],cost[mm],nex[mm];int head[mn],dis[mn],p[mn],q[mn]

2016-05-30 18:02:58 3401

和最小费用流模板对比着看：最小费用流模板贴上最大流模板：#include#includeusing namespace std;const int oo=1e9;/**oo 表示无穷大*/const int mm=111111111;/**mm 表示边的最大数量，记住要是原图的两倍，在加边的时候都是双向的*/const int mn=999;/**mn 表示点的最大数量*/int node,src,

2016-05-30 18:01:11 2464

原创 poj2195（二分图最大匹配，最小费用流）

Going HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 21120 Accepted: 10668DescriptionOn a grid map there are n little men and n houses. In each u

2016-05-30 17:55:06 1541

原创 poj2771(二分图，最大独立集)

Guardian of DecencyTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 5398 Accepted: 2269DescriptionFrank N. Stein is a very conservative high-school tea

2016-05-30 16:49:11 687

原创 poj2817（状态压缩dp基础题）

WordStackTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3435 Accepted: 1254DescriptionAs editor of a small-town newspaper, you know that a substantia

2016-05-27 19:47:49 783

原创 light oj 1032(数位dp)

1032 - Fast Bit Calculations PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBA bit is a binary digit, taking a logical value of

2016-05-24 18:32:25 439

原创 hdu3652（数位dp）

B-numberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4184 Accepted Submission(s): 2397Problem DescriptionA wqb-number, or

2016-05-24 16:27:45 430

原创图的有关操作

1．键盘输入数据，建立一个有向图的邻接表。2．输出该邻接表。3．在有向图的邻接表的基础上计算各顶点的度，并输出。4．以有向图的邻接表为基础实现输出它的拓扑排序序列。5．采用邻接表存储实现无向图的深度优先非递归遍历。6．采用邻接表存储实现无向图的广度优先遍历。7．在主函数中设计一个简单的菜单，分别调试上述算法。#include #include #include #

2016-05-22 17:21:54 799

原创 hdu4734（数位dp）

F(x)Time Limit: 1000/500 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3530 Accepted Submission(s): 1317Problem DescriptionFor a decimal number x

2016-05-19 20:58:57 1628

原创 hdu4722（数位dp）

Good NumbersTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3971 Accepted Submission(s): 1269Problem DescriptionIf we sum up

2016-05-18 21:04:04 628

原创 hdu5188(01背包变形)

zhx and contestTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 725 Accepted Submission(s): 266Problem DescriptionAs one of th

2016-05-18 19:36:15 552

原创 hdu1712（01背包）

ACboy needs your helpTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6054 Accepted Submission(s): 3309Problem DescriptionACbo

2016-05-16 19:27:08 457

原创 hdu2639（01背包求第k优解）

Bone Collector IITime Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3803 Accepted Submission(s): 1966Problem DescriptionThe titl

2016-05-16 18:43:17 651

原创 hdu2602（01背包）

Bone CollectorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 47758 Accepted Submission(s): 19921Problem DescriptionMany year

2016-05-16 16:55:16 411

原创 poj1837(01背包)

BalanceTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 12867 Accepted: 8071DescriptionGigel has a strange "balance" and he wants to poise it. Actually

2016-05-13 12:00:34 353

原创 hdu4587（去掉两个点让强连通分量最大）

TWO NODESTime Limit: 24000/12000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1702 Accepted Submission(s): 530Problem DescriptionSuppose that G

2016-05-12 20:17:05 778

原创 poj1276（多重背包）

Cash MachineTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 31684 Accepted: 11405DescriptionA Bank plans to install a machine for cash withdrawal. The

2016-05-11 19:03:49 733

原创 poj3694（割边，LCA）

NetworkTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 8578 Accepted: 3138DescriptionA network administrator manages a large network. The network cons

2016-05-11 15:37:03 477

原创 poj1904(强连通分量，缩点)

King's QuestTime Limit: 15000MS Memory Limit: 65536KTotal Submissions: 8460 Accepted: 3087Case Time Limit: 2000MSDescriptionOnce upon a time there lived a

2016-05-10 20:19:43 977

原创 cf22E（加最少的边形成强连通图）

E. Schemetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputTo learn as soon as possible the latest news abou

2016-05-06 16:58:34 876

原创 hdu4745（区间dp，求最大回文串的长度）

Two RabbitsTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 1346 Accepted Submission(s): 669Problem DescriptionLong long ago,

2016-05-05 19:21:44 672

原创 cf22C (构造带割点的图)

DescriptionBob got a job as a system administrator in X corporation. His first task was to connect n servers with the help of m two-way direct connection so that it becomes possible to transmit

2016-05-05 11:31:22 488

原创文件的输入输出的应用

1．使用字符输出流将一段文字存入文件，然后使用输入流读取文件中的内容。public class main { public static void main(String[] args) { File file = new File("hello.txt"); String s; Scanner r = new Scanner(System.in); s = r.nextLi

2016-05-04 19:37:38 670

原创 hdu5396（区间dp）

ExpressionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 736 Accepted Submission(s): 427Problem DescriptionTeacher Mai has n

2016-05-04 19:01:34 419

原创 hdu4635（强连通分量，缩点）

Strongly connectedTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2202 Accepted Submission(s): 916Problem DescriptionGive a s

2016-05-04 16:06:27 410

原创 tarjan模板（缩点，求有向图强连通分量）

整理出了这个tarjan模板，具体数组的功能代码都有注释。const int N=100010;struct data{ int to,next;} tu[N*2];int head[N];int ip;int dfn[N], low[N];///dfn[]表示深搜的步

2016-05-04 15:53:49 3211

原创求割点模板（tarjan算法思路）

想看更多模板，请点击：http://blog.csdn.net/martinue/article/category/6268283贴上求割点模板：const int N=110;struct data{ int to,next;} tu[N*N]

2016-05-04 14:08:47 2213 2

原创 poj1144（求割点）

NetworkTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11692 Accepted: 5430DescriptionA Telephone Line Company (TLC) is establishing a new telephone c

2016-05-04 12:41:54 427

原创 cf149D（区间dp）

DescriptionOnce Petya read a problem about a bracket sequence. He gave it much thought but didn't find a solution. Today you will face it.You are given string s. It represents a correct bracket

2016-05-03 13:09:37 649

martinue