- 博客(111)
- 收藏
- 关注
RSS订阅
原创 基本算法
=====================================[ 模拟 ]=====================================HDU1070:MilkHDU2005:第几天？HDU2037:今年暑假不ACHDU2090:算菜价HDU2091:空心三角形HDU2097:Sky数HDU
2015-09-30 00:24:17
523
原创 More Effective C++：Item 27
温习More Effective C++，对于Item 27：要求或禁止在堆中产生对象，整理思路于此文。编译期控制通过禁用定义对象所需的条件，以在编译期阻止对象的定义。 下表列出了不同位置上不同形式的对象定义所需函数的最低访问权限。 class operator new 构造函数 ←堆内对象 堆外对象→ 构造函数 class
2015-08-08 16:26:42
721
原创 More Effective C++：Item 27
温习More Effective C++，对于Item 27：要求或禁止在堆中产生对象，整理思路于此文。编译期控制通过禁用编译器产生对象所需的选项即可在编译期阻止对象被定义。产生堆对象所需的选项： class operator new 构造函数 析构函数 独立对象 public 不需要，可定义伪构造函数 不需要，可定义伪析构函数 成员对象
2015-07-31 23:36:57
676
原创 带符号整数的除法与余数
复习C++ Prime 4th的时候，看见书上对/和%操作符有以下描述： For both division (/) and modulus(%), when both operands are positive, the result is positive (or zero). If both operands are negative, the result of division is
2015-03-28 23:21:57
3384
原创 POJ1014:Dividing
点击打开题目链接DividingTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 54312 Accepted: 13895DescriptionMarsha and Bill own a collection of marble
2013-11-11 21:39:42
1012
原创 HDU1114:Piggy-Bank [POJ1384]
点击打开题目链接Piggy-BankTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9076 Accepted Submission(s): 4588Problem Descriptio
2013-11-11 17:23:25
916
原创 POJ1948:Triangular Pastures
点击打开题目链接Triangular PasturesTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 5919 Accepted: 1901DescriptionLike everyone, cows enjoy varie
2013-11-11 17:12:48
1025
原创 POJ1837:Balance
点击打开题目链接BalanceTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 9459 Accepted: 5822DescriptionGigel has a strange "balance" and he wants to
2013-11-11 13:39:41
1335
原创 HDU4512:吉哥系列故事--完美队形I
点击打开题目链接吉哥系列故事——完美队形ITime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1692 Accepted Submission(s): 497Problem Descript
2013-10-08 18:06:17
935
原创 HDU1423:Greatest Common Increasing Subsequence
点击打开题目链接Greatest Common Increasing SubsequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3074 Accepted Submission(s): 966
2013-09-28 18:04:04
1012
原创 HDU4360:As long as Binbin loves Sangsang
点击打开题目链接As long as Binbin loves SangsangTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2315 Accepted Submission(s): 544Pro
2013-09-26 20:25:30
1034
原创 POJ1847:Tram
点击打开题目链接TramTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 8817 Accepted: 3207DescriptionTram network in Zagreb consists of a number of int
2013-09-07 19:43:28
1052
原创 POJ1062:昂贵的聘礼
点击打开题目链接昂贵的聘礼Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 32550 Accepted: 9269Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了，于是便向酋长去求亲。酋长要他
2013-09-07 16:35:58
924
原创 POJ1486:Sorting Slides
点击打开题目链接Sorting SlidesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2961 Accepted: 1140DescriptionProfessor Clumsey is going to give an
2013-08-24 23:28:13
971
原创 POJ1469:COURSES
点击打开题目链接COURSESTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 15621 Accepted: 6171DescriptionConsider a group of N students and P courses
2013-08-22 22:58:14
842
原创 二分图的匈牙利算法与常用定理小节
一、二分图的判定。 二分图是这样一个图： 顶点集可划分为两个不相交子集且使得任意一条边的两个顶点分别位于两个子集中的无向图。 判定二分图的常见方法是染色法： 开始对任意一未染色的顶点染色，之后判断其相邻的顶点中，若未染色则将其染上和相邻顶点不同的颜色， 若已经染色且颜色和相邻顶点的颜色相同则说明不是二分图，若颜色不同则继续判断，bfs和dfs可以搞定！
2013-08-21 23:11:04
1000
原创 HDU1151:Air Raid
点击打开题目链接Air RaidTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2539 Accepted Submission(s): 1654Problem Description
2013-08-19 21:56:37
755
原创 HDU1150:Machine Schedule
Machine ScheduleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4511 Accepted Submission(s): 2204Problem DescriptionAs we all
2013-08-19 19:13:30
836
原创 HDU1068:Girls and Boys
点击打开题目链接Girls and BoysTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5966 Accepted Submission(s): 2672Problem Desc
2013-08-19 16:44:54
870
原创 HDU3488:Tour
点击打开题目链接TourTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 1387 Accepted Submission(s): 729Problem DescriptionIn
2013-08-19 10:35:39
845
原创 HDU2255:奔小康赚大钱
点击打开题目链接奔小康赚大钱Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2248 Accepted Submission(s): 987Problem Description
2013-08-18 15:25:15
848
原创 HDU2819:Swap
点击打开题目链接SwapTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1046 Accepted Submission(s): 348Special JudgeProblem Desc
2013-08-18 00:57:11
961
原创 POJ3041:Asteroids
点击打开题目链接AsteroidsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12568 Accepted: 6829DescriptionBessie wants to navigate her spaceship thr
2013-08-17 21:48:31
773
原创 图论
==============================================最短路==============================================HDU1869:六度分离HDU1874:畅通工程续HDU2066:一个人的旅行HDU2112:HDU TodayHDU2544:最短路HDU366
2013-08-17 18:55:52
618
原创 POJ2239:Selecting Courses
点击打开题目链接Selecting CoursesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7814 Accepted: 3463DescriptionIt is well known that it is not easy
2013-08-17 17:06:53
805
原创 HDU3790:最短路径问题
点击打开题目链接最短路径问题Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8692 Accepted Submission(s): 2622Problem Description
2013-08-15 21:44:40
878
原创 POJ2488:A Knight's Journey
点击打开题目链接A Knight's JourneyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 25877 Accepted: 8829DescriptionBackground The knight is gettin
2013-08-14 23:36:33
925
原创 HDU3665:Seaside
点击打开题目链接SeasideTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 955 Accepted Submission(s): 679Problem Description
2013-08-14 01:31:21
859
原创 HDU1869:六度分离
点击打开题目链接六度分离Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3094 Accepted Submission(s): 1198Problem Description
2013-08-14 00:57:15
731
原创 POJ3321:Apple Tree
点击打开题目链接Apple TreeTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 16270 Accepted: 4872DescriptionThere is an apple tree outside of kaka's
2013-08-13 03:39:05
1113
原创 HDU2227:Find the nondecreasing subsequences
点击打开题目链接Find the nondecreasing subsequencesTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1215 Accepted Submission(s): 422
2013-08-12 22:50:13
747
原创 滚动数组优化陷阱
尼玛本来我一直是把问题写在相应的题目里面的，但是这个问题严重得让我不得不特意写一篇专门的文章。昨晚contest的Problem E，freezhan学姐用背包写AC了，但是优化成一维后连样例都过不了，然后我就研究了一下。这是优化前的代码： F[0][0]=1; for(int i=1;i<=N;++i) { for(int j=M;j>=A[i];--j) {
2013-08-12 01:49:10
1161
原创 HDU3874:Necklace
点击打开题目链接NecklaceTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1993 Accepted Submission(s): 711Problem Description
2013-08-11 16:36:01
1096
原创 [Virtual Judge]ZOJ1610:Count the Colors
===========================================题目大意===========================================在一条直线上给某些区间染色，染色时之前染的颜色会被覆盖，输出最后可以在直线上看见的颜色以及该颜色在直线上的区间个数。======================================
2013-08-11 10:03:58
825
原创 HDU1754:I Hate It
点击打开题目链接I Hate ItTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 27284 Accepted Submission(s): 10845Problem Descripti
2013-08-10 10:10:34
668
原创 HDU1677:Nested Dolls
点击打开题目链接Nested DollsTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1923 Accepted Submission(s): 537Problem Descripti
2013-08-09 09:24:00
1291
1
原创 HDU1257:最少拦截系统
点击打开题目链接最少拦截系统Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12985 Accepted Submission(s): 5171Problem Description
2013-08-07 16:44:02
1033
原创 [模板]最长有序子序列
/*#######################################[ LOS Templet Of Lyz ]#######################################*///Cmp:返回所求序列中前后元素的比较关系("",">="即对应"升序","不降序","降序","不降序")typedef /*序列类型*/ SEQUTYPE;typedef bo
2013-08-06 15:06:06
664
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人