05 2016 档案

最小费用流模板
摘要：和最大流模板对比着看：最大流模板（Dinic） 贴上最小费用流模板： const int oo=1e9;const int mm=11111111;const int mn=888888;int node,src,dest,edge;int ver[mm],flow[mm],co... 阅读全文
posted @ 2016-05-30 18:02 martinue 阅读(140) 评论(0) 推荐(0)
最大流模板（Dinic）
摘要：最大流模板： #include#includeusing namespace std;const int oo=1e9;/**oo 表示无穷大*/const int mm=111111111;/**mm 表示边的最大数量，记住要是原图的两倍，在加边的时候都是双向的*/cons... 阅读全文
posted @ 2016-05-30 18:01 martinue 阅读(671) 评论(0) 推荐(0)
poj2195（二分图最大匹配，最小费用流）
摘要：Going Home Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 21120 Accepted: 10668 Description On a grid map there are n ... 阅读全文
posted @ 2016-05-30 17:55 martinue 阅读(1781) 评论(0) 推荐(0)
poj2771(二分图，最大独立集)
摘要：Guardian of Decency Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 5398 Accepted: 2269 Description Frank N. Stein is a... 阅读全文
posted @ 2016-05-30 16:49 martinue 阅读(566) 评论(0) 推荐(0)
poj2817（状态压缩dp基础题）
摘要：WordStack Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 3435 Accepted: 1254 Description As editor of a small-town new... 阅读全文
posted @ 2016-05-27 19:47 martinue 阅读(195) 评论(0) 推荐(0)
light oj 1032(数位dp)
摘要：1032 - Fast Bit Calculations PDF (English) Statistics Forum Time Limit: 2 second(s) Memory Limit: 32 MB A bit is a binary digi... 阅读全文
posted @ 2016-05-24 18:32 martinue 阅读(158) 评论(0) 推荐(0)
hdu3652（数位dp）
摘要：B-number Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4184 Accepted Submission(s): ... 阅读全文
posted @ 2016-05-24 16:27 martinue 阅读(204) 评论(0) 推荐(0)
图的有关操作
摘要：1．键盘输入数据，建立一个有向图的邻接表。 2．输出该邻接表。 3．在有向图的邻接表的基础上计算各顶点的度，并输出。 4．以有向图的邻接表为基础实现输出它的拓扑排序序列。 5．采用邻接表存储实现无向图的深度优先非递归遍历。 6．采用邻接表存储实现无向图的广度优先遍历。 7．在主函数中设计一个简... 阅读全文
posted @ 2016-05-22 17:21 martinue 阅读(378) 评论(0) 推荐(0)
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): 1317 ... 阅读全文
posted @ 2016-05-19 20:58 martinue 阅读(148) 评论(0) 推荐(0)
hdu4722（数位dp）
摘要：Good Numbers Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3971 Accepted Submission(... 阅读全文
posted @ 2016-05-18 21:04 martinue 阅读(167) 评论(0) 推荐(0)
hdu5188(01背包变形)
摘要：zhx and contest Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 725 Accepted Submissio... 阅读全文
posted @ 2016-05-18 19:36 martinue 阅读(171) 评论(0) 推荐(0)
hdu1712（01背包）
摘要：ACboy needs your help Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 6054 Accepted Su... 阅读全文
posted @ 2016-05-16 19:27 martinue 阅读(124) 评论(0) 推荐(0)
hdu2639（01背包求第k优解）
摘要：Bone Collector II Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3803 Accepted Submis... 阅读全文
posted @ 2016-05-16 18:43 martinue 阅读(142) 评论(0) 推荐(0)
hdu2602（01背包）
摘要：Bone Collector Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 47758 Accepted Submissi... 阅读全文
posted @ 2016-05-16 16:55 martinue 阅读(143) 评论(0) 推荐(0)
poj1837(01背包)
摘要：Balance Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 12867 Accepted: 8071 Description Gigel has a strange "balance" ... 阅读全文
posted @ 2016-05-13 12:00 martinue 阅读(126) 评论(0) 推荐(0)
hdu4587（去掉两个点让强连通分量最大）
摘要：TWO NODES Time Limit: 24000/12000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 1702 Accepted Submission(s... 阅读全文
posted @ 2016-05-12 20:17 martinue 阅读(338) 评论(0) 推荐(0)
poj1276（多重背包）
摘要：Cash Machine Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 31684 Accepted: 11405 Description A Bank plans to install ... 阅读全文
posted @ 2016-05-11 19:03 martinue 阅读(164) 评论(0) 推荐(0)
poj3694（割边，LCA）
摘要：Network Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 8578 Accepted: 3138 Description A network administrator manages... 阅读全文
posted @ 2016-05-11 15:37 martinue 阅读(189) 评论(0) 推荐(0)
poj1904(强连通分量，缩点)
摘要：King's Quest Time Limit: 15000MS Memory Limit: 65536K Total Submissions: 8460 Accepted: 3087 Case Time Limit: 2000MS Description ... 阅读全文
posted @ 2016-05-10 20:19 martinue 阅读(190) 评论(0) 推荐(0)
cf22E（加最少的边形成强连通图）
摘要：E. Scheme time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output To learn as... 阅读全文
posted @ 2016-05-06 16:58 martinue 阅读(283) 评论(0) 推荐(0)
hdu4745（区间dp，求最大回文串的长度）
摘要：Two Rabbits Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others) Total Submission(s): 1346 Accepted Submission(... 阅读全文
posted @ 2016-05-05 19:21 martinue 阅读(302) 评论(0) 推荐(0)
cf22C (构造带割点的图)
摘要：Description Bob 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... 阅读全文
posted @ 2016-05-05 11:31 martinue 阅读(198) 评论(0) 推荐(0)
文件的输入输出的应用
摘要：1．使用字符输出流将一段文字存入文件，然后使用输入流读取文件中的内容。 public class main { public static void main(String[] args) { File file = new File("hello.txt"); String s; Sc... 阅读全文
posted @ 2016-05-04 19:37 martinue 阅读(164) 评论(0) 推荐(0)
hdu5396（区间dp）
摘要：Expression Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 736 Accepted Submission(s):... 阅读全文
posted @ 2016-05-04 19:01 martinue 阅读(136) 评论(0) 推荐(0)
hdu4635（强连通分量，缩点）
摘要：Strongly connected Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2202 Accepted Submi... 阅读全文
posted @ 2016-05-04 16:06 martinue 阅读(309) 评论(0) 推荐(0)
tarjan模板（缩点，求有向图强连通分量）
摘要：具体思路见详解网址：https://www.byvoid.com/blog/scc-tarjan； 然后整理出了这个tarjan模板，具体数组的功能代码都有注释。 const int N=100010;struct data{ int to,next;} tu[N*2];int hea... 阅读全文
posted @ 2016-05-04 15:53 martinue 阅读(168) 评论(0) 推荐(0)
求割点模板（tarjan算法思路）
摘要：求割点讲解网址：http://www.cnblogs.com/en-heng/p/4002658.html 网址给出的是伪代码，我用前向星实现的。 判断一个点是否为割点的时候直接看cut[]数组，如果为1表示该点是割点，否则不是。如果求个数直接遍历一遍1到n的cut[i]就行。 const i... 阅读全文
posted @ 2016-05-04 14:08 martinue 阅读(230) 评论(0) 推荐(0)
poj1144（求割点）
摘要：Network Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 11692 Accepted: 5430 Description A Telephone Line Company (TLC)... 阅读全文
posted @ 2016-05-04 12:41 martinue 阅读(134) 评论(0) 推荐(0)
cf149D（区间dp）
摘要：Description Once 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 ... 阅读全文
posted @ 2016-05-03 13:09 martinue 阅读(336) 评论(0) 推荐(0)