- 博客(42)
- 资源 (6)
- 收藏
- 关注
RSS订阅原创 hdu1709 The Balance （放入+取出 01背包）
The BalanceTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6973 Accepted Submission(s): 2874Problem DescriptionNow you ar
2015-12-24 15:20:38
567
转载 欧拉函数
原文链接：https://zh.m.wikipedia.org/zh/%E6%AC%A7%E6%8B%89%E5%87%BD%E6%95%B0欧拉函数本文介绍的是小于或等于n的正整数中与n 互质的数的数目。关于形式为的函数，详见「欧拉函数(复变函数)」。当n为1至1000的整数时的值在数论中，对正整数n，欧
2015-12-23 22:01:53
11135
1
转载 RMQ问题 (st+线段树)
RMQ问题博客分类： 算法J#算法 RMQ (Range Minimum/Maximum Query)问题是指：对于长度为n的数列A，回答若干询问RMQ(A,i,j)(i,j主要方法及复杂度(处理复杂度和查询复杂度)如下: 1.朴素（即搜索） O(n)-O(n) 2.线段树(segment tree) O(n)-O(qlogn) 3.ST（实质是
2015-12-22 19:45:15
662
原创 hdu2152 Fruit (背包dp)
FruitTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4076 Accepted Submission(s): 2319Problem Description转眼到了收获的季节，由于有TT的
2015-12-18 21:31:52
593
原创 hdu2082 找单词 （背包dp）
找单词Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5384 Accepted Submission(s): 3813Problem Description假设有x1个字母A， x2个字母B,
2015-12-18 20:37:05
590
原创 hdu1171 Big Event in HDU (多重背包)
Big Event in HDUTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 31013 Accepted Submission(s): 10873Problem DescriptionNo
2015-12-18 19:55:03
570
原创 hdu1085 Holding Bin-Laden Captive! （多重背包）
Holding Bin-Laden Captive!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18710 Accepted Submission(s): 8329Problem Descrip
2015-12-18 17:25:36
830
原创 hdu1398 Square Coins （完全背包）
Square CoinsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10146 Accepted Submission(s): 6944Problem DescriptionPeople i
2015-12-18 17:07:36
536
原创 hdu1028 Ignatius and the Princess III (完全背包)
Ignatius and the Princess IIITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16474 Accepted Submission(s): 11609Problem Descr
2015-12-18 17:00:13
734
原创 [HNOI2008]越狱 (快速幂模)
1008: [HNOI2008]越狱Time Limit: 1 Sec Memory Limit: 162 MBSubmit: 6179 Solved: 2630[Submit][Status][Discuss]Description监狱有连续编号为1...N的N个房间，每个房间关押一个犯人，有M种宗教，每个犯人可能信仰其中一种。如果相邻房间的犯人的宗教相同，就可能发生
2015-12-14 20:41:59
500
原创 poj3253 Fence Repair （优先队列）
Fence RepairTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 34695 Accepted: 11177DescriptionFarmer John wants to repair a small length of the fence arou
2015-12-13 17:56:28
501
原创 poj3069 Saruman's Army （贪心）
Saruman's ArmyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6049 Accepted: 3085DescriptionSaruman the White must lead his army along a straight path
2015-12-13 17:41:18
479
原创 poj3617 Best Cow Line （贪心）
Best Cow LineTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14855 Accepted: 4221DescriptionFJ is about to take his N (1 ≤ N ≤ 2,000) cows to the annual
2015-12-13 17:07:47
651
原创 poj2386 Lake Counting （深搜）
Lake CountingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 25416 Accepted: 12803DescriptionDue to recent rains, water has pooled in various places i
2015-12-13 15:37:02
522
原创 poj1852 Ants （模拟）
AntsTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 12810 Accepted: 5606DescriptionAn army of ants walk on a horizontal pole of length l cm, each with
2015-12-13 14:14:37
436
原创 hdu2141 Can you find it? （二分查找）
Can you find it?Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/10000 K (Java/Others)Total Submission(s): 19334 Accepted Submission(s): 4860Problem DescriptionGiv
2015-12-12 21:36:45
450
原创 hdu2648 Shopping （map模拟）
ShoppingTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2628 Accepted Submission(s): 920Problem DescriptionEvery girl li
2015-12-12 20:27:21
970
原创 hdu1905 Pseudoprime numbers （快速幂+素数筛法）
Pseudoprime numbersTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2529 Accepted Submission(s): 1055Problem DescriptionFe
2015-12-12 17:52:12
693
原创 hdu1969 Pie （二分）
PieTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7202 Accepted Submission(s): 2699Problem DescriptionMy birthday is com
2015-12-12 16:36:25
617
原创 hdu2899 Strange fuction （二分+导数）
Strange fuctionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5095 Accepted Submission(s): 3633Problem DescriptionNow, h
2015-12-12 16:08:20
565
原创 hdu2199 Can you solve this equation? (二分+double精度)
Can you solve this equation?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14274 Accepted Submission(s): 6359Problem Descrip
2015-12-12 15:31:50
490
原创 hdu2159 FATE (二维完全背包)
FATETime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10363 Accepted Submission(s): 4915Problem Description最近xhd正在玩一款叫做FATE
2015-12-08 17:30:21
489
原创 hdu4508 湫湫系列故事——减肥记I （完全背包）
湫湫系列故事——减肥记ITime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 3837 Accepted Submission(s): 1939Problem Description 对于吃货来说，
2015-12-07 22:40:52
444
原创 hdu1114 Piggy-Bank （完全背包）
Piggy-BankTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17273 Accepted Submission(s): 8704Problem DescriptionBefore A
2015-12-07 22:22:44
416
原创 hdu2602 Bone Collector （01背包）
Bone CollectorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 42517 Accepted Submission(s): 17708Problem DescriptionMany
2015-12-07 22:07:56
347
原创 hdu1785 You Are All Excellent （极角排序）
You Are All ExcellentTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4341 Accepted Submission(s): 1451Problem Description
2015-12-07 21:57:09
579
原创 hdu1558 Segment set （判断线段相交+并查集）
Segment setTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4358 Accepted Submission(s): 1634Problem DescriptionA segment
2015-12-07 21:33:09
569
原创 hdu2150 Pipe (判断线段是否相交)
PipeTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1572 Accepted Submission(s): 603Problem Description经过激烈的争夺，Lele终于把那块地
2015-12-07 20:46:54
879
原创 hdu1348 Wall (求凸包周长)
WallTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4671 Accepted Submission(s): 1337Problem DescriptionOnce upon a tim
2015-12-06 16:37:46
562
原创 hdu1392 Surround the Trees (求凸包周长)
Surround the TreesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9307 Accepted Submission(s): 3558Problem DescriptionThe
2015-12-03 16:55:26
613
转载 Graham's Scan法求解凸包问题
原文链接：http://www.cnblogs.com/devymex/archive/2010/08/09/1795392.htmlGraham's Scan法求解凸包问题概念凸包(Convex Hull)是一个计算几何（图形学）中的概念。用不严谨的话来讲，给定二维平面上的点集，凸包就是将最外层的点连接起来构成的凸多边型，它能包含点集中所有点的。严谨的定义和相关概念参
2015-12-02 17:12:25
811
原创 hdu2108 Shape of HDU （叉乘，判断是否为凸包）
Shape of HDUTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6230 Accepted Submission(s): 2856Problem Description话说上回讲到海东集
2015-12-02 16:49:33
934
转载 void main()误区
原文链接：http://blog.csdn.net/zlhy_/article/details/8756080 很多人甚至市面上的一些书籍，都使用了void main（ ） ，其实这是错误的。C/C++ 中从来没有定义过void main（ ） .C++ 之父 Bjarne Stroustrup 在他的主页上的 FAQ 中明确地写着 The definition vo
2015-12-02 12:10:36
1364
转载 求逆序对数的NLogN解法：归并排序、树状数组和线段树
原文链接：http://www.cnblogs.com/oa414/archive/2011/07/20/2111538.html这个是我找到的，我认为比较好的博文，为了尽量还原，我这里直接纠结了两张图放在这儿，原文还附加了几道例题解析。
2015-12-02 12:10:01
502
原创 chrome浏览器主页被篡改如何解决
我这里列出几种类型及解决方法：1.快捷方式被篡改。 这种情况的话，直接把chrome的快捷方式删掉，然后chrome的安装地址中，找到chrome.exe文件，重新生成一个快捷方式即可。 这种情况的话，在chrome的设置里面进行修改是没有用的，360的主页锁定也没有用。2.
2015-12-02 12:09:24
1314
原创 tyvj1034 尼克的任务 （动态规划+链表）
P1034 尼克的任务时间: 1000ms / 空间: 131072KiB / Java类名: Main背景题库靠大家，人人都爱它。描述尼克每天上班之前都连接上英特网，接收他的上司发来的邮件，这些邮件包含了尼克主管的部门当天要完成的全部任务，每个任务由一个开始时刻与一个持续时间构成。尼克的一个工作日为N分钟，从第一分钟开始到第N分钟结束。当尼
2015-12-02 12:05:13
789
转载 计算几何-多边形的重心
原文链接：http://www.cnblogs.com/jbelial/archive/2011/08/08/2131165.html1. 1 累加和求重心设平面上有N 个离散数据点( xi , yi ) ( i = 1, 2, ., n) , 其多边形重心G( . x1, . y1) 为: 这是求多边形最简单直观的方法。可以直接利用离散数据点的x, y坐标就能求
2015-12-02 12:03:50
2189
原创 hdu1115 Lifting the Stone （求多边形重心）
Lifting the StoneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6716 Accepted Submission(s): 2794Problem DescriptionTher
2015-12-02 12:01:16
460
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人