...

专题

计算几何:http://blog.csdn.net/zsc09_leaf/article/details/6331809 http://blog.csdn.net/accry/article/details/6070621 (半平面交)

2013-07-18 10:48:10

阅读数:621

评论数:0

poj 2104 K-th Number(划分树)

K-th Number Time Limit: 20000MS   Memory Limit: 65536K Total Submissions: 32249   Accepted: 10022 Case Time Limit: 2000MS Description Y...

2013-07-31 18:43:59

阅读数:338

评论数:0

zoj 3686 A Simple Tree Problem(dfs+线段树)

A Simple Tree Problem Time Limit: 3 Seconds      Memory Limit: 65536 KB Given a rooted tree, each node has a boolean (0 or 1) labeled on it. In...

2013-07-31 12:46:58

阅读数:417

评论数:0

fzu 2129 子序列个数 (dp)

Problem 2129 子序列个数 Accept: 25    Submit: 63 Time Limit: 2000 mSec    Memory Limit : 32768 KB  Problem Description 子序列的定义:对于一个序列a=a[1],a[2...

2013-07-30 13:57:44

阅读数:458

评论数:0

zoj 3689 Digging (dp)

Digging Time Limit: 2 Seconds      Memory Limit: 65536 KB When it comes to the Maya Civilization, we can quickly remind of a term called the ...

2013-07-30 13:54:13

阅读数:428

评论数:0

最近公共祖先LCA:RMQ转化

1,最近公共祖先(LCA):  对于有根树T的两个结点u、v,最近公共祖先LCA(T,u,v)表示一个结点x,满足x是u、v的祖先且x的深度尽可能大。 2,LCA问题向RMQ问题的转化方法:(RMQ返回最值的下标)  对树进行深度优先遍历,每当“进入”或回溯到某个结点时,将这个结点的深度存入...

2013-07-29 18:51:53

阅读数:392

评论数:0

UESTC 1709 Binary Operations (位运算)

Submit Status Best Solution Back Description Bob has a sequence of N integers. They are so attractive, that Alice begs...

2013-07-29 14:15:59

阅读数:530

评论数:0

UESTC 1711 Divide 解题报告

Divide Time Limit: 2000 ms Memory Limit: 65535 kB Solved: 30 Tried: 743 Submit Status Best Solution Back Descri...

2013-07-28 00:08:57

阅读数:764

评论数:0

POJ - 1155 TELE(树形dp)

TELE Time Limit: 1000MS   Memory Limit: 65536KB   64bit IO Format: %I64d & %I64u [Submit]   [Go Back]   [Status]   Description A TV...

2013-07-27 17:32:48

阅读数:362

评论数:0

fzu1844 Earthquake Damage (网络流 最大流最小割/ISAP)

Earthquake Damage Time Limit: 1000MS   Memory Limit: 32768KB   64bit IO Format: %I64d & %I64u [Submit]   [Go Back]   [Status]   Descr...

2013-07-27 12:24:47

阅读数:433

评论数:0

图论小结

图论小结 1 拓扑排序:复杂度o(n+m) 普通的拓扑排序没什么好说的,在一些特殊结构的拓扑图上(比如自动机,度有限制的图或树),结合最小表示法(我一般都是并查集+map)可以判图的同构 推荐题:Poj3687  Uvalive3981  Ural1872 2 最短路 :  a)...

2013-07-26 12:58:51

阅读数:439

评论数:0

模板库

叉姐:https://github.com/ftiasch/shoka vain:https://github.com/Azure-Vani/acm-template

2013-07-26 00:08:04

阅读数:326

评论数:0

二分图最大匹配总结

原地址:http://www.cppblog.com/acronix/archive/2010/08/21/124175.html 1。一个二分图中的最大匹配数等于这个图中的最小点覆盖数 【转自Matirx67】二分图最大匹配的König定理及其证明     本文将是这一系列里最...

2013-07-25 22:59:40

阅读数:290

评论数:0

poj 1469 COURSES (二分图最大匹配)

COURSES Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 15254   Accepted: 6013 Description Consider a gr...

2013-07-25 12:58:51

阅读数:341

评论数:0

poj 1873 The Fortified Forest (暴力搜索+凸包求周长)

The Fortified Forest Time Limit: 1000MS   Memory Limit: 30000KB   64bit IO Format: %I64d & %I64u [Submit]   [Go Back]   [Status]   De...

2013-07-23 20:33:50

阅读数:397

评论数:0

hdu 1700 (计算几何 向量的坐标变换)

Description There is a cycle with its center on the origin. Now give you a point on the cycle, you are to find out the other two points on it, to ma...

2013-07-23 11:21:22

阅读数:371

评论数:0

hdu 2196 computer (树形dp)

Computer Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1885    Accepted Submission(s): 9...

2013-07-21 15:53:16

阅读数:449

评论数:0

网络流(模板)

理论:http://mindlee.net/2011/11/19/network-flow/ //Edmonds-Karp(EK)hdu3549 #include #include #include using namespace std; const int M=110; con...

2013-07-20 12:42:11

阅读数:418

评论数:0

Codeforces 96D Volleyball (两次spfa)

D. Volleyball time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output ...

2013-07-19 19:16:42

阅读数:365

评论数:0

计算几何

理论:http://mindlee.net/2011/11/27/computational-geometry/ http://blog.chinaunix.net/uid-12127321-id-2957853.html //hdu 1392 凸包 #include #include...

2013-07-18 10:41:10

阅读数:358

评论数:0

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