- 博客(34)
- 收藏
- 关注
RSS订阅原创 hdu1969 Pie(二分答案)
PieTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4312 Accepted Submission(s): 1735Problem DescriptionMy birthday is coming up a
2014-11-30 22:41:54
658
原创 hdu4190 Distributing Ballot Boxes(二分答案)
Problem DescriptionToday, besides SWERC'11, another important event is taking place in Spain which rivals it in importance: General Elections. Every single resident of the country aged 18 or over is
2014-11-30 22:38:24
880
原创 hdu2604 Queuing(矩阵快速幂 + DP)
QueuingTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2859 Accepted Submission(s): 1314Problem DescriptionQueues and Priority Q
2014-11-20 22:39:17
468
原创 hdu1280(比m大的数)---哈希表
前m大的数Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11163 Accepted Submission(s): 3866Problem Description还记得Gardon给小希布置的那个作业么？
2014-11-19 09:40:12
823
原创 哈希表(初步实现)
#include#include#include#includeusing namespace std;#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define Maxsize 100 //储存空间初始化分配量#define SUCCESS 1#define UNSUCCESS 0#define H
2014-11-18 21:08:22
490
原创 hdu1864(最大报销额 DP动态规划)
最大报销额Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16926 Accepted Submission(s): 4929Problem Description现有一笔经费可以报销一定额度的发票。允许报销的
2014-11-17 09:55:41
4735
9
原创 POJ2533(Longest Ordered Subsequence 最长公共子序列 DP或单调队列+二分)
Longest Ordered SubsequenceTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 34454 Accepted: 15135DescriptionA numeric sequence of ai is ordered ifa1 a2 a
2014-11-16 20:20:15
2900
1
原创 hdu4310 Hero(贪心)
HeroTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2658 Accepted Submission(s): 1196Problem DescriptionWhen playing DotA with go
2014-11-15 23:56:43
526
原创 Sticks POJ1011 hdu1455 (深度优先搜索DFS)
SticksTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 122528 Accepted: 28390DescriptionGeorge took sticks of the same length and cut them randomly until a
2014-11-15 21:33:10
788
原创 hdu1789(Doing Homework again 贪心)
Doing Homework againTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7011 Accepted Submission(s): 4164Problem DescriptionIgnat
2014-11-12 19:14:08
429
转载 素数筛法
素数筛法 素数是ACM中数论题目常常涉及到得问题。最基本的问题就是如何判断一个数是素数以及如何快速的打出题目涉及范围的素数表。当然数论中关于素数的问题会比较复杂，在这里仅就素数的不同筛法做出总结。 素数，就是只有1和自身两个约数的正整数。2是最小的素数。根据定义，我们就可以直接判断一个数字n是否是素数。优化后的复杂度是O(n*sqrt(n))。至于为什么，我就不做赘述了
2014-11-12 14:18:58
443
原创 hdu2124--Repair the Wall(贪心水题)
Repair the WallTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2158 Accepted Submission(s): 1057Problem DescriptionLong time ago
2014-11-12 11:39:31
795
原创 hdu1086-最少拦截系统(简单贪心)
最少拦截系统Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19697 Accepted Submission(s): 7816Problem Description某国为了防御敌国的导弹袭击,发展出一种导弹拦
2014-11-12 10:33:57
512
原创 2010acm区域赛(哈尔滨)--Assignments(贪心水题)
Problem DescriptionIn a factory, there are N workers to finish two types of tasks (A and B). Each type has N tasks. Each task of type A needs xi time to finish, and each task of type B needs yj time
2014-11-11 10:37:21
615
原创 hdu1086+You can Solve a Geometry Problem too(计算几何，计算线段交点个数)
You can Solve a Geometry Problem tooTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7732 Accepted Submission(s): 3775Problem Descri
2014-11-10 12:28:05
711
原创 poj1269 Intersecting Lines(计算几何--两条直线的交点)
Intersecting LinesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11307 Accepted: 5110DescriptionWe all know that a pair of distinct points on a plane def
2014-11-08 23:05:42
1507
原创 hdu3665 seaside(floyd算法)
SeasideTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1130 Accepted Submission(s): 825Problem DescriptionXiaoY is living in
2014-11-08 11:10:45
487
原创 hdu2066 一个人的旅行(Dijkstra求最短路)
一个人的旅行Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 20126 Accepted Submission(s): 7024Problem Description虽然草儿是个路痴（就是在杭电待了一年多，居然
2014-11-07 22:30:03
560
原创 hdu1879(Kruskal最小生成树)--继续畅通工程
继续畅通工程Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14396 Accepted Submission(s): 6270Problem Description省政府“畅通工程”的目标是使全省任何两个村庄
2014-11-07 10:56:04
502
原创 hdu1162(并查集+Kruskal最小生成树)-- Eddy's picture
Eddy's pictureTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7097 Accepted Submission(s): 3588Problem DescriptionEddy begins to
2014-11-05 19:49:20
562
转载 hdu题目分类
1001 这个就不用说了吧1002 简单的大数1003 DP经典问题，最大连续子段和1004 简单题1005 找规律（循环点）1006 感觉有点BT的题，我到现在还没过1007 经典问题，最近点对问题，用分治1008 简单题1009 贪心1010
2014-11-05 11:52:26
407
原创 hdu 1863畅通工程(prim最小生成树)
畅通工程Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 17968 Accepted Submission(s): 7609Problem Description省政府“畅通工程”的目标是使全省任何两个村庄间都
2014-11-05 10:22:09
457
原创 hdu1102(Constructing Roads)--prim最小生成树
Constructing RoadsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14545 Accepted Submission(s): 5521Problem DescriptionThere are
2014-11-04 18:44:01
451
原创 迷宫问题(八个方向寻找)DFS
迷宫问题（八方向）input:16 80 1 1 1 0 1 1 11 0 1 0 1 0 1 00 1 0 0 1 1 1 10 1 1 1 0 0 1 11 0 0 1 1 0 0 00 1 1 0 0 1 1 0output:YES(1,1) (2,2) (3,1) (4,1) (5,2) (5,3) (6,4) (6,5) (5,6) (4,
2014-11-04 14:16:15
3293
原创 二分法五行核心代码
#include#includeusing namespace std;const int maxn = 1000;int main(){ int n; int a[maxn]; while (cin >> n) { for (int i = 1; i <= n; i++) cin >> a[i]; sort(a + 1, a + n + 1); cout <<
2014-11-04 14:12:26
604
原创 最短路算法(Floyd)
Floyd算法又称为，插点法，是一种用于寻找给定的加权图中多源点之间最短路径的算法。该算法名称以创始人之一、1978年图灵奖获得者、斯坦福大学计算机科学系教授罗伯特·弗洛伊德命名。
2014-11-04 14:08:23
447
原创 大数阶乘(c++)
直接上代码：#includeusing namespace std;const int maxn = 10000;int main(){ int n,m; while(cin>>n) { int f[maxn]; memset(f,0,sizeof(f)); f[0] = 1; for(int i=2;i<=n;i++) { int c=0;//用来进
2014-11-04 14:05:04
654
转载 最短路径算法—Dijkstra(迪杰斯特拉)
Dijkstra(迪杰斯特拉)算法是典型的最短路径路由算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。 Dijkstra算法是很有代表性的最短路算法，在很多专业课程中都作为基本内容有详细的介绍，如数据结构，图论，运筹学等等。其基本思想是，设
2014-11-04 13:57:07
1163
原创 hdu 2648(Shopping) STL map的使用
ShoppingTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2018 Accepted Submission(s): 666Problem DescriptionEvery girl likes shop
2014-11-02 14:56:16
574
原创 hdu1013(大数水题)
Digital RootsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 50214 Accepted Submission(s): 15669Problem DescriptionThe digital ro
2014-11-01 22:27:58
470
原创 hdu 1009 FatMouse' Trade(贪心)
Problem DescriptionFatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean.The warehouse has N rooms. The i-th room conta
2014-11-01 20:47:49
426
原创 hdu1272 -- 小希的迷宫(并查集)
小希的迷宫Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 27437 Accepted Submission(s): 8463Problem Description上次Gardon的迷宫城堡小希玩了很久（见Pr
2014-11-01 10:50:54
468
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人