hebozi - 博客园

HOJ 2430 Counting the algorithms 树状数组+MAP的应用

摘要： Counting the algorithmsMy Tags(Edit) Cancel - Seperate tags with commas.Source : mostlegTime limit : 1 secMemory limit : 64 MSubmitted : 492, Accepted : 190As most of the ACMers, wy's next target is algorithms, too. wy is clever, so he can learn most of the algorithms quickly. After a short time 阅读全文

posted @ 2012-08-05 11:56 hebozi 阅读(160) 评论(0) 推荐(0)

HOJ 1867 经理的烦恼一维树状数组

摘要：经理的烦恼My Tags(Edit) Cancel - Seperate tags with commas.Source : HCPC 2005 SpringTime limit : 2 secMemory limit : 32 MSubmitted : 1929, Accepted : 442Jerry是一家公司销售部门的经理。这家公司有很多连锁店，编号为1，2，3，... Jerry每天必须关注每家连锁店的商品数量及其变化，一项很乏味的工作。在连锁店比较少的时候，Jerry喜欢计算编号在[i,j]区间内的连锁店中商品数量为素数的有多少家，但是现在连锁店的数量急剧增长，计算量很大，J... 阅读全文

posted @ 2012-08-05 11:54 hebozi 阅读(186) 评论(0) 推荐(0)

HDU 3450 Counting Sequences 树状数组+DP

摘要： Counting SequencesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/65536 K (Java/Others)Total Submission(s): 1158Accepted Submission(s): 397Problem DescriptionFor a set of sequences of integers｛a1，a2，a3，...an｝, we define a sequence｛ai1,ai2,ai3...aik｝in which 1<=i1<i2<i3<...<i 阅读全文

posted @ 2012-08-05 11:40 hebozi 阅读(153) 评论(0) 推荐(0)

水饺基情二维树状数组

摘要：水饺基情TimeLimit:3000/1000ms(Java/Other)MemoryLimit:65535/32768K(Java/Other)TotalSubmission(s):43AcceptedSubmission(s):4Font:TimesNewRoman|Verdana|GeorgiaFontSize:←→ProblemDescription在看完植物大战僵尸后，雄哥强烈要求zzy在203留宿，地点就在雄哥的睡袋上。是不是很基情？？长夜漫漫无心睡眠，雄哥拿出了积攒已久的一盒水饺，（因为饿了==）。半夜三更，四下无人，zzy和雄哥决定把水饺吃掉，但是！他们玩了一个十分基情的游戏。阅读全文

posted @ 2012-08-05 11:37 hebozi 阅读(163) 评论(0) 推荐(0)

最大匹配+vector的应用

摘要：非诚勿扰Time Limit : 3000/1000ms (Java/Other)Memory Limit : 65535/32768K (Java/Other)Total Submission(s) : 134Accepted Submission(s) : 15Font: Times New Roman | Verdana | GeorgiaFont Size: ← →Problem Description某卫视新推一档类似“非诚勿扰”的征婚交友节目，每期节目均有N名男生和N名女生。节目开始前每人都要给出自己的薪水和对另一半的薪水期望（比自己高或者比自己低）。一名男生只能和一名女生配对，并阅读全文

posted @ 2012-08-05 11:02 hebozi 阅读(207) 评论(0) 推荐(0)

单词的前缀字典树

摘要：单词的前缀TimeLimit:3000/1000ms(Java/Other)MemoryLimit:65535/32768K(Java/Other)TotalSubmission(s):167AcceptedSubmission(s):46Font:TimesNewRoman|Verdana|GeorgiaFontSize:←→ProblemDescriptionZZY针对某个单词表给单词定义了特别的前缀，该前缀使得在该表中可以唯一标识某个单词，并且前缀的长度是最短。若有单词是另一个单词的前缀，那么该单词的前缀就是其本身。Input输入包含多组数据，对于每组数据，第一行是整数N(1~1000) 阅读全文

posted @ 2012-08-05 10:54 hebozi 阅读(337) 评论(0) 推荐(0)

求三角形内包括边上的点的数目

摘要：三角形TimeLimit:3000/1000ms(Java/Other)MemoryLimit:65535/32768K(Java/Other)TotalSubmission(s):137AcceptedSubmission(s):90Font:TimesNewRoman|Verdana|GeorgiaFontSize:←→ProblemDescription平面上有x+2*y=N，x=0以及y=0三线围成的一个直角三角形，请帮忙计算该三角形内（包括边上）的整点的个数，其中整点表示x,y都取整数的点。Input第一行输入一整数T,表示有T组测试数据，接下来有T行，每行输入一个数N.(1< 阅读全文

posted @ 2012-08-05 10:40 hebozi 阅读(455) 评论(0) 推荐(0)

HDU 4325 Flowers

摘要： FlowersTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1022Accepted Submission(s): 513Problem DescriptionAs is known to all, the blooming time and duration varies between different kinds of flowers. Now there is a garden planted full of flowers. Th 阅读全文

posted @ 2012-08-05 10:32 hebozi 阅读(128) 评论(0) 推荐(0)

HDU 4324 Triangle LOVE

摘要： Triangle LOVETime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1033Accepted Submission(s): 425Problem DescriptionRecently, scientists find that there is love between any of two people. For example, between A and B, if A don’t love B, then B must love 阅读全文

posted @ 2012-08-05 10:28 hebozi 阅读(138) 评论(0) 推荐(0)

HDU 4320 Arcane Numbers 1 判断两个数的质因子是否完全相同

摘要： Arcane Numbers 1Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1666Accepted Submission(s): 527Problem DescriptionVance and Shackler like playing games. One day, they are playing a game called "arcane numbers". The game is pretty simple, 阅读全文

posted @ 2012-08-05 10:24 hebozi 阅读(189) 评论(0) 推荐(0)

2012年8月5日