排序:
默认
按更新时间
按访问量

UVa10375(唯一分解定理)

The binomial coefficient C(m, n) is defined as C(m, n) = m! (m − n)! n! Given four natural numbers p, q, r, and s, compute the the result of dividing...

2017-10-26 17:16:49

阅读数:438

评论数:0

UVa12169(拓展欧几里得)

Once upon a time, there was an NWERC judge with a tendency to create slightly too hard problems. As a result, his problems were never solved. As you ...

2017-10-26 13:15:41

阅读数:434

评论数:0

最小费用流 uva10806

You are a political prisoner in jail. Things are looking grim, but fortunately, your jailmate has come up with an escape plan. He has found a way for...

2017-10-21 20:45:35

阅读数:484

评论数:0

HDU 5934 强连通分量

There are NN bombs needing exploding. Each bomb has three attributes: exploding radius riri, position (xi,yi)(xi,yi) and lighting-cost cici which m...

2017-10-21 19:05:18

阅读数:554

评论数:0

tarjan算法的学习 uva12167,uva315,uva796

图的强连通&tarjan算法 强连通图:如果有向图G中的任意两个点u,v是互相可到达的,则称图G为强连通图。否则G为非强连通图。 强连通分量:若有向图G为非强连通图,它的子图G' 是强连通图,则称G' 为G的强连通分量。(极大强连通子图) 返图:将有向图G中的...

2017-10-19 22:20:39

阅读数:203

评论数:0

floyd求图的最小环路 HDU1599

find the mincost route Time Limit: 1000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5879 Accepted Subm...

2017-10-10 13:04:15

阅读数:393

评论数:0

树的最小支配集poj3659、最小点覆盖、最大独立集

Cell Phone Network Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7002 Accepted: 2509 Description Farmer John has decided to give each...

2017-10-09 19:56:09

阅读数:434

评论数:0

HDU 6129 just do it(组合数奇偶性)

Just do it Time Limit: 5000/2500 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others) Total Submission(s): 1411 Accepted Submission(s):...

2017-10-08 18:32:39

阅读数:409

评论数:0

HDU 6090 Rikka with Graph (图论规律题)

Rikka with Graph Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1009 Accepted Submission...

2017-10-08 16:59:49

阅读数:365

评论数:0

HDU 4474 同余模定理+BFS

Yet Another Multiple Problem Time Limit: 40000/20000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 6255 Accep...

2017-10-04 21:12:57

阅读数:592

评论数:0

HDU 4465 Candy 概率期望值的对数优化

题目链接:http://acm.split.hdu.edu.cn/showproblem.php?pid=4465 Candy Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) T...

2017-10-04 15:50:16

阅读数:619

评论数:0

ICPC2015(沈阳)HDU5521 建图技巧+最短路

Meeting Time Limit: 12000/6000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 3533 Accepted Submission(s): 1...

2017-10-02 17:10:26

阅读数:620

评论数:0

树上两点最近公共祖先LCA的倍增算法 poj1986

Distance Queries Time Limit: 2000MS Memory Limit: 30000K Total Submissions: 14755 Accepted: 5187 Case Time Limit: 1000MS Description Farmer John's...

2017-09-29 20:13:07

阅读数:551

评论数:0

矩形面积并集,2017ICPC网络赛(南宁)Overlapping Rectangles

矩形面积并集 There are nn rectangles on the plane. The problem is to find the area of the union of these rectangles. Note that these rectangles might over...

2017-09-25 21:27:53

阅读数:587

评论数:0

ICPC2017网络赛(南宁)子序列最大权值(树状数组+dp)

Let SS be a sequence of integers s_{1}s ​1 ​​ , s_{2}s ​2 ​​ , ......, s_{n}s ​n ​​ Each integer is is associated with a weight by the following rule...

2017-09-24 20:13:35

阅读数:506

评论数:0

ICPC2017网络赛(北京)Minimum(线段树or树状数组区间最值维护)

描述 You are given a list of integers a0, a1, …, a2^k-1. You need to support two types of queries: 1. Output Minx,y∈[l,r] {ax∙ay}. 2. Let ax=y. 输入 ...

2017-09-24 11:38:13

阅读数:317

评论数:0

ICPC2017网络赛(北京)Territorial Dispute(凸包分割)

#1582 : Territorial Dispute 时间限制:1000ms 单点时限:1000ms 内存限制:256MB 描述 In 2333, the C++ Empire and the Java Republic become the most powerful country in t...

2017-09-23 18:09:49

阅读数:621

评论数:0

二分匹配 4579: 多米诺骨牌II(中石油)

4579: 多米诺骨牌II 时间限制: 1 Sec 内存限制: 128 MB 提交: 42 解决: 11 [提交][状态][讨论版] 题目描述 一个矩形可以划分成M*N个小正方形,其中有一些小正方形不能使用。一个多米诺骨牌占用两个相邻的小正方形。试问整个区域内最多可以不重叠地放多少个多米诺骨...

2017-09-23 11:36:32

阅读数:334

评论数:0

最小树形图--有向图的最小生成树 poj 3164 Command Network

【最小树形图】: 就是给有向带权图中指定一个特殊的点root,求一棵以root为根的有向生成树T,并且T中所有边的总权值最小。 最小树形图必须有一个根,而且选择不同的点作为根,也是不一样的结果。 最小树形图必须包含图中的每一个节点,并且均可通过有向边到达根节点root 最小树形图的第一个算法是 ...

2017-09-22 17:26:45

阅读数:505

评论数:0

次小生成树的学习 POJ1679 The Unique MST

The Unique MST Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 32145 Accepted: 11631 Description Given a connected undirected graph, tel...

2017-09-21 22:13:01

阅读数:287

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭