- 博客(22)
- 收藏
- 关注
RSS订阅原创 Poj1195(二维树状数组）
Mobile phones Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 17636 Accepted: 8157 Description Suppose that the fourth generation mobile phone base stati
2016-04-22 22:54:40
237
原创 Poj2299（离散化）
Description In this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence elements until the s
2016-04-21 23:44:57
369
原创 Poj2352
Stars Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 40161 Accepted: 17440 Description Astronomers often examine star maps where stars are represented b
2016-04-21 22:03:31
403
原创 Hrb1924
分数表达式 Time Limit: 1000 MS Memory Limit: 32768 K Total Submit: 249(118 users) Total Accepted: 123(114 users) Rating: Special Judge: No Description
2016-04-20 21:24:23
262
原创 hrbust2291
Help C5 Time Limit: 1000 MS Memory Limit: 65535 K Total Submit: 172(40 users) Total Accepted: 52(38 users) Rating: Special Judge: No Description
2016-04-18 20:02:50
570
原创 poj2083
Fractal Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 8604 Accepted: 4081 Description A fractal is an object or quantity that displays self-similarity, in a somewhat technic
2016-04-18 20:01:06
711
原创 2106/04/16练习赛（四）
A - Easy Task ZOJ 2969 Time Limit: 2000 MS Memory Limit: 65536 KB Description
2016-04-16 21:50:48
881
原创 Hdu1507
Uncle Tom's Inherited Land* Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2998 Accepted Submission(s): 1243 Special Judge Proble
2016-04-14 09:46:16
481
原创 Hdu1498
50 years, 50 colors Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
2016-04-12 22:34:53
317
转载 二分图知识点
二分图大讲堂——彻底搞定最大匹配数（最小覆盖数）、最大独立数、最小路径覆盖、带权最优匹配 文本内容框架： §1图论点、边集和二分图的相关概念和性质 §2二分图最大匹配求解 匈牙利算法、Hopcroft-Karp算法 §3二分图最小覆盖集和最大独立集的构造 §4二分图最小路径覆盖求解 §5二分图带权最优匹配求解 Kuhn-Munkers算法 §6小结 每章节都详细地讲解了
2016-04-11 22:21:34
555
原创 Hdu1281
棋盘游戏 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Problem Description 小希和Gardon
2016-04-11 22:20:28
427
原创 2016/04/09练习赛（三）
练习赛晚去了40Min，还提前走了1H，hahhahahha。 J - A Computer Graphics Problem HDU 4716 Time Limit: 1000 MS Memory Li
2016-04-09 23:22:07
306
原创 Hdu1068（二分图的最大匹配）
Girls and Boys Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 9814 Accepted Submission(s): 4495 Problem Description the secon
2016-04-07 20:28:40
484
原创 Hdu1533带权二分图的最小匹配
Going Home Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3961 Accepted Submission(s): 2036 Problem Description On a grid ma
2016-04-07 20:07:59
464
原创 Hdu1533
Going Home Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3947 Accepted Submission(s): 2025 Problem Description On a grid map
2016-04-07 10:06:19
413
原创 poj2135（模板题）
Farm Tour Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 14270 Accepted: 5441 Description When FJ's friends visit him on the farm, he likes to show them
2016-04-06 21:59:04
521
原创 最小费用最大流
这几天看了关于最小费用最大流的算法，说实话并没有十分的理解，准备把之前的最大流再回顾一下。。。。。。 给一份模板。 #include using namespace std; struct{ int v, cap, cost, next, re; // re记录逆边的下标。 }edge[eMax]; int n, m, ans; int k, edgeHead
2016-04-06 21:53:01
301
转载 Hdu4146
Flip Game Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 1842 Accepted Submission(s): 607 Problem Description Flip game is pla
2016-04-05 20:02:41
613
原创 2016/04/03练习赛（2）
B - Bacon's Cipher HDU 4144 Time Limit: 1000 MS Memory Limit: 32768 KB 64-bit integer IO format: %I64d , %I64u Java class name: Main [Submit] [Status] Description Bacon's cipher
2016-04-03 20:31:02
417
转载 ZOJ3712（set+map)写得好
这是浙江省赛的F题，题意是给你n个人，m对朋友关系，如果两个人的公共好友超过k人，那他们可以成为新的朋友，问经过一段“”足够长的时间后“， 新产生了多少对朋友关系这题，发现可以用STL秒， 枚举每对未成为朋友的i和j，如果其公共好友超过k人，那么增加这对关系，然后继续枚举。。。直到不能增加新关系为止 #include #include #include #include
2016-04-02 23:04:12
327
原创 2016/04/02省选练习赛（1）
J - Java Beans ZOJ 3714 Description There are N little kids sitting in a circle, each of them are carrying some java beans in their hand. Their teacher want to select M kids who seated in
2016-04-02 22:51:50
481
原创 Hdu4857逃生（逆向）
Problem Description 糟糕的事情发生啦，现在大家都忙着逃命。但是逃命的通道很窄，大家只能排成一行。 现在有n个人，从1标号到n。同时有一些奇怪的约束条件，每个都形如：a必须在b之前。 同时，社会是不平等的，这些人有的穷有的富。1号最富，2号第二富，以此类推。有钱人就贿赂负责人，所以他们有一些好处。 负责人现在可以安排大家排队的顺序，由于收了好处，所以他要让
2016-04-01 21:41:16
562
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人