树状数组 - 随笔分类 - hebozi

HDU 2838 Cow Sorting 树状数组求逆序数

摘要：Cow SortingTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1192Accepted Submission(s): 393Problem DescriptionSherlock's N (1 ≤ N ≤ 100,000) cows are lined up to be milked in the evening. Each cow has a unique "grumpiness" level in the 阅读全文

posted @ 2012-08-08 21:20 hebozi 阅读(260) 评论(0) 推荐(0)

HDU 2642 Stars 二维树状数组

摘要：StarsTime Limit: 5000/2000 MS (Java/Others)Memory Limit: 32768/65536 K (Java/Others)Total Submission(s): 628Accepted Submission(s): 268Problem DescriptionYifenfei is a romantic guy and he likes to count the stars in the sky.To make the problem easier,we considerate the sky is a two-dimension plane.S 阅读全文

posted @ 2012-08-05 21:34 hebozi 阅读(164) 评论(0) 推荐(0)

HDU 1892 See you~ 二维树状数组

摘要：See you~Time Limit: 5000/3000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 2023Accepted Submission(s): 645Problem DescriptionNow I am leaving hust acm. In the past two and half years, I learned so many knowledge about Algorithm and Programming, and I met so many good 阅读全文

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

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)

HUD 4339 Query 树状数组+二分查询

摘要：QueryTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1267Accepted Submission(s): 391Problem DescriptionYou are given two strings s1[0..l1], s2[0..l2] and Q - number of queries.Your task is to answer next queries:1) 1 a i c - you should set i-th c 阅读全文

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

随笔分类 - 树状数组