- 博客(13)
- 收藏
- 关注
原创 hdu 1285 确定比赛名次(拓扑排序)
确定比赛名次Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18377 Accepted Submission(s): 7355Problem Description有N个比赛队(1
2015-11-30 16:18:42 291
原创 hdu 2444 The Accomodation of Students(判断二分图+匈牙利算法)
The Accomodation of StudentsTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4085 Accepted Submission(s): 1873Problem Descri
2015-11-28 13:21:56 338
原创 POJ 3041 Asteroids(二分图匹配+匈牙利算法)
AsteroidsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 18296 Accepted: 9973DescriptionBessie wants to navigate her spaceship through a dangerous asteroid field in the shape of
2015-11-28 11:25:59 439
原创 hdu 3460 Ancient Printer(贪心 or Trie树)
Ancient PrinterTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 1507 Accepted Submission(s): 744Problem DescriptionThe co
2015-11-28 11:22:27 333
原创 hdu 2063 过山车(纯裸hungary算法)
过山车Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15344 Accepted Submission(s): 6722Problem DescriptionRPG girls今天和大家一起去
2015-11-26 18:26:39 356
原创 hdu 1058 Humble Numbers(优先队列+set)
Humble NumbersTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21549 Accepted Submission(s): 9411Problem DescriptionA numb
2015-11-26 12:35:40 358
原创 hdu 1385 Minimum Transport Cost(Floyd打印路径)
Minimum Transport CostTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9113 Accepted Submission(s): 2406Problem Description
2015-11-24 21:27:13 356
原创 hdu 1251 统计难题(字典树)
转载自:http://www.cnblogs.com/dong008259/archive/2011/11/11/2244900.html字典树(trie树)、后缀树(1)字典树(Trie树) Trie是个简单但实用的数据结构,通常用于实现字典查询。我们做即时响应用户输入的AJAX搜索框时,就是Trie开始。本质上,Trie是一颗存储多个字符串的树。相
2015-11-16 21:28:02 305
原创 hdu 3415 Max Sum of Max-K-sub-sequence(单调队列)
题意:由n'个数组成的环形序列a1,a2...an,其中a1左边是an,an右边是a1,,求该序列中长度不超过k的子序列的最大和。思路:将a1..an复制到a1+n...a2*n,然后用sum[i]记录前i项和,那么sum[i]-sum[i-m]就是长度为m的子序列的和,用单调队列维护下标,具体过程如下。代码:/* * main.cpp * * Created
2015-11-12 22:10:57 310
原创 hdu 2544 最短路(最短路算法之Dijkstra)
首先,按个人理解说一下最小生成树和最短路的区别:最小生成树是要把所有点都连接起来,计算最小权值,而最短路不需要连接所有点,只需要连接起点和终点,其他不一定都要连接。Prim算法和Dijkstra算法的区别就在于此。一开始想了很久。然后,下面介绍一下Dijkstra算法(大家可以对比一下Prim算法,源码相似度很高,容易混):先引用一张图,说一下Dijkstra算法的
2015-11-10 17:52:04 317
原创 hdu 1556 Color the ball(前缀和)
Color the ball /* * mai.cpp * * Created on: 2015年9月15日 * Author: chen */#include#include#include#include#include#include#include#include#include#include#include#include
2015-11-09 17:56:25 410
原创 hdu 1162 Eddy's picture(最小生成树之kruskal算法)
Eddy's pictureEddy begins to like painting pictures recently ,he is sure of himself to become a painter.Every day Eddy draws pictures in his small room, and he usually puts out his newest pictures t
2015-11-06 23:19:32 409
原创 最小生成树(Prim算法和Kruskal算法)
最小生成树:一个有 n 个结点的连通图的生成树是原图的极小连通子图,且包含原图中的所有 n 个结点,并且有保持图连通的最少的边。概述:在一给定的无向图G = (V, E) 中,(u, v) 代表连接顶点 u 与顶点 v 的边(即),而 w(u, v) 代表此边的权重,若存在 T 为 E 的子集(即)且为无循环图,使得 w(T) 最小,则此 T 为 G 的最小生成树。最小生成
2015-11-02 16:55:13 609
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人