- 博客(33)
- 收藏
- 关注
RSS订阅原创 poj 1180 dp的斜率优化
http://poj.org/problem?id=1180DescriptionThere is a sequence of N jobs to be processed on one machine. The jobs are numbered from 1 to N, so that the sequence is 1,2,..., N. The sequence of jo
2014-10-31 21:18:02
856
原创 hdu 3507 斜率优化DP入门题
http://acm.hdu.edu.cn/showproblem.php?pid=3507Problem DescriptionZero has an old printer that doesn't work well sometimes. As it is antique, he still like to use it to print articles. But it
2014-10-30 17:55:09
637
原创 poj1141 区间dp
http://poj.org/problem?id=1141DescriptionLet us define a regular brackets sequence in the following way: 1. Empty sequence is a regular sequence. 2. If S is a regular sequence, then (S)
2014-10-29 16:19:25
613
原创 hdu 4685 概率dp
http://acm.hdu.edu.cn/showproblem.php?pid=4865Problem DescriptionRecently, Peter likes to measure the humidity of leaves. He recorded a leaf humidity every day. There are four types of leave
2014-10-27 15:22:26
629
原创 poj 1014 多重背包问题
http://poj.org/problem?id=1014DescriptionMarsha and Bill own a collection of marbles. They want to split the collection among themselves so that both receive an equal share of the marbles. Thi
2014-10-26 19:20:58
737
原创 poj 2353 类似数塔（需标记路径）
http://poj.org/problem?id=2353DescriptionMr. F. wants to get a document be signed by a minister. A minister signs a document only if it is approved by his ministry. The ministry is an M-floor
2014-10-23 19:08:56
580
原创 2014鞍山现场赛D题 E题||hdu5073、5074
D题：http://acm.hdu.edu.cn/showproblem.php?pid=5073
2014-10-23 15:25:02
734
原创 poj1276 多重背包问题（二进制解决方案）
http://poj.org/problem?id=1276DescriptionA Bank plans to install a machine for cash withdrawal. The machine is able to deliver appropriate @ bills for a requested cash amount. The machine uses
2014-10-22 09:35:33
984
原创 hdu3853 概率dp
http://acm.hdu.edu.cn/showproblem.php?pid=3853Problem DescriptionAkemi Homura is a Mahou Shoujo (Puella Magi/Magical Girl).Homura wants to help her friend Madoka save the world. But beca
2014-10-15 16:39:53
569
原创 2014牡丹江现场赛A题D题I题（水，概率Dp，水）ZOJ 3819,3822,3827
A：知道小明班里其他人的成绩，知道其邻班每个人的成绩，先如果xiao
2014-10-13 11:47:43
766
转载 图的割点、桥与双连通分支
[点连通度与边连通度]在一个无向连通图中，如果有一个顶点集合，删除这个顶点集合，以及这个集合中所有顶点相关联的边以后，原图变成多个连通块，就称这个点集为割点集合。一个图的点连通度的定义为，最小割点集合中的顶点数。类似的，如果有一个边集合，删除这个边集合以后，原图变成多个连通块，就称这个点集为割边集合。一个图的边连通度的定义为，最小割边集合中的边数。[双连通图、割点与桥]如果一个
2014-10-10 14:54:45
706
原创 poj3177&&poj3352 无向图的双连通问题（至少加几条边原图变为双连通图）
题目链接：http://poj.org/problem?id=3177解题思路：
2014-10-10 14:43:42
742
原创 acdreamOJ 1236 求无向图的桥
http://115.28.76.232/problem?pid=1236Problem Description Ferry Kingdom is a nice little country located on N islands that are connected by M bridges. All bridges are very beautiful and
2014-10-08 21:41:35
699
原创 最小路径覆盖（最小边覆盖&&最小点覆盖）hdu1150
【最小边覆盖(原图是二分图)】：在图中找一些边，使之覆盖了图中所有顶点，且任何一个顶点有且只有一条边与之关联。最小边覆盖 = 最大独立集 = |V| - 最大匹配数【最小顶点覆盖】：用最少的点（左右两边集合的点）让每条边都至少和其中一个点关联。
2014-10-08 19:02:16
1465
原创 ZOJ 2319 最长上升子序列并输出组成该序列的元素编号
http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2319
2014-10-04 09:20:47
722
原创 ACdreamoj 1412 dp
http://115.28.76.232/problem?pid=1412Problem Description 2-3 tree is an elegant data structure invented by John Hopcroft. It is designed to implement the same functionality as the binar
2014-10-02 17:11:34
571
原创 poj 3311 状态压缩DP
http://poj.org/problem?id=3311DescriptionThe Pizazz Pizzeria prides itself in delivering pizzas to its customers as fast as possible. Unfortunately, due to cutbacks, they can afford to hire on
2014-10-01 11:53:49
884
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人