acm_数据结构
文章平均质量分 83
kongming_acm
kongming_acm
展开
-
树状数组
树状数组学习系列1 之 初步分析——czyuan原创2009年08月13日 星期四 15:41<br /><br /> 其实学树状数组说白了就是看那张图,那张树状数组和一般数组的关系的,看懂了基本就没问题了,推荐下面这个教程:http://www.topcoder.com/tc?module=Static&d1=tutorials&d2=binaryIndexedTrees<br /><br /> 下面对树状数组进行一些分析。<br />inline int Lowbit(int x原创 2010-07-26 09:36:00 · 673 阅读 · 0 评论 -
2299 Ultra-QuickSort 树状数组求逆序数
Ultra-QuickSortTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 15773 Accepted: 5563DescriptionIn this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent原创 2010-07-26 10:41:00 · 637 阅读 · 1 评论 -
1195 Mobile phones 二维树状数组
Mobile phonesTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 6843 Accepted: 2905DescriptionSuppose that the fourth generation mobile phone base stations in the Tampere area operate as follows. The area is divided into squares. The squares form an原创 2010-07-27 08:46:00 · 475 阅读 · 0 评论 -
3468 A Simple Problem with Integers 线段树 求区间和 向区间添加值
A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072K Total Submissions: 12834 Accepted: 3113 Case Time Limit: 2000MS DescriptionYou have N integers, A1, A2, ... , AN. You need to deal with two kinds of operations. One type原创 2010-07-27 22:12:00 · 445 阅读 · 0 评论 -
hdu 1166 敌兵布阵 树状数组求区间和和修改点的值
敌兵布阵<br />Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 3605 Accepted Submission(s): 1439<br /><br />Problem DescriptionC国的死对头A国这段时间正在进行军事演习,所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,D原创 2010-07-28 09:22:00 · 500 阅读 · 0 评论 -
3067 Japan 统计两块区域连线之间的交点个数 树状数组
JapanTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8853 Accepted: 2380<br />DescriptionJapan plans to welcome the ACM ICPC World Finals and a lot of roads must be built for the venue. Japan is tall island with N cities on the East coast and M c原创 2010-07-30 11:02:00 · 700 阅读 · 0 评论 -
2352 Stars 树状数组
StarsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13884 Accepted: 5961<br />DescriptionAstronomers often examine star maps where stars are represented by points on a plane and each star has Cartesian coordinates. Let the level of a star be an原创 2010-07-30 09:04:00 · 469 阅读 · 0 评论 -
hdu 1556 Color the ball 线段树求区间和 向区间添加值
Color the ballTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1515 Accepted Submission(s): 635Problem DescriptionN个气球排成一排,从左到右依次编号为1,2,3....N.每次给定2个整数a b(a Input每个测试实例第一行为一个整数N,(N 当N = 0,输入结束。 Ou原创 2010-08-11 18:58:00 · 541 阅读 · 0 评论 -
hdu I Hate It 线段树 求区间最大、小值
I Hate It<br />Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)<br />Total Submission(s): 5847 Accepted Submission(s): 2048<br /><br />Problem Description很多学校流行一种比较的习惯。老师们很喜欢询问,从某某到某某当中,分数最高的是多少。<br />这让很多学生很反感。<br /><原创 2010-08-12 11:20:00 · 451 阅读 · 0 评论 -
hdu 1698 Just a Hook 线段树 求区间和 修改区间的值
Just a Hook<br />Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)<br />Total Submission(s): 3392 Accepted Submission(s): 1469<br /><br />Problem DescriptionIn the game of DotA, Pudge’s meat hook is actually the most ho原创 2010-08-12 22:49:00 · 373 阅读 · 0 评论 -
2777 Count Color 线段树 求区间颜色覆盖的颜色个数
Count ColorTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14531 Accepted: 4137<br />DescriptionChosen Problem Solving and Program design as an optional course, you are required to solve all kinds of problems. Here, we get a new problem. <br /><b原创 2010-08-12 20:18:00 · 564 阅读 · 0 评论 -
2481 Cows 树状数组 求一段区间被几段区间覆盖的问题
CowsTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 5104 Accepted: 1596<br />DescriptionFarmer John's cows have discovered that the clover growing along the ridge of the hill (which we can think of as a one-dimensional number line) in his field i原创 2010-08-13 10:53:00 · 638 阅读 · 0 评论 -
hdu 1394 Minimum Inversion Number 归并排序求逆序数 求一串数的最小逆序数
Minimum Inversion Number<br />Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 927 Accepted Submission(s): 514<br /><br />Problem DescriptionThe inversion number of a given number sequence a1,原创 2010-08-13 10:58:00 · 508 阅读 · 0 评论 -
2182 Lost Cows 已知逆序数 求原来数列序列 树状数组
Lost CowsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5119 Accepted: 3210<br />DescriptionN (2 <= N <= 8,000) cows have unique brands in the range 1..N. In a spectacular display of poor judgment, they visited the neighborhood 'watering hole' a原创 2010-08-13 14:30:00 · 662 阅读 · 0 评论 -
hdu 2795 Billboard 线段树变形
Billboard<br />Time Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)<br />Total Submission(s): 561 Accepted Submission(s): 254<br /><br />Problem DescriptionAt the entrance to the university, there is a huge rectangular bi原创 2010-08-13 21:02:00 · 537 阅读 · 0 评论 -
hdu 1892 See you~ 二维树状数组
See you~ Time Limit: 5000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 921 Accepted Submission(s): 291 Problem Description Now I am leaving hust acm. In the past two and half years, I learned so many knowledge about原创 2010-08-22 22:15:00 · 693 阅读 · 0 评论 -
hdu 2492 Ping pong 数状数组 求左面比其小、大,右面比其大、小的数的个数
Ping pongTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 688 Accepted Submission(s): 230Problem DescriptionN(3Each player has a unique skill rank. To improve their skill rank, they often compete wi原创 2010-08-22 22:17:00 · 659 阅读 · 0 评论 -
hdu 3530 Subsequence 单调队列 求最长连续区间,满足条件(m<=max-min<=k)
SubsequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 734 Accepted Submission(s): 277Problem DescriptionThere is a sequence of integers. Your task is to find the longest subsequence that satis原创 2010-08-30 20:06:00 · 974 阅读 · 0 评论 -
2185 Milking Grid 找最小匹配的矩形 KMP 代码有错,但是过了
Milking GridTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 2054 Accepted: 858<br />DescriptionEvery morning when they are milked, the Farmer John's cows form a rectangular grid that is R (1 <= R <= 10,000) rows by C (1 <= C <= 75) columns. As we原创 2010-10-09 20:00:00 · 528 阅读 · 0 评论 -
2406 Power Strings KMP 判断字符串最多由几部分组成
Power StringsTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 14524 Accepted: 6098<br />DescriptionGiven two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think of conca原创 2010-10-09 11:14:00 · 645 阅读 · 0 评论 -
3461 Oulipo 计算a中多少个与b匹配的子串 两个KMP模板
OulipoTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6169 Accepted: 2342DescriptionThe French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the Oulipo group. A quote from the book:原创 2010-10-09 11:56:00 · 439 阅读 · 0 评论 -
2761 Feed the dogs 求任一区间的第k小数 线段树+划分树
Feed the dogsTime Limit: 6000MS Memory Limit: 65536KTotal Submissions: 8160 Accepted: 2218<br />DescriptionWind loves pretty dogs very much, and she has n pet dogs. So Jiajia has to feed the dogs every day for Wind. Jiajia loves Wind, but not the dogs, so原创 2010-10-09 20:14:00 · 719 阅读 · 0 评论 -
tyvj 1154 买饭队列 单调队列
Fromlemon_tsyd☆买饭队列 背景 Background 话说小q的高中生活开始了~ 描述 Description 一天,小q冲到了食堂却发现饭卡没带(囧。。。),只好回去取,再回去的途中他还想知道他所排的队的情况,所以他让一个同学帮忙监视。(初始队列为0)<br />同学知道队列的进出情况。(具体请看样例)<br />针对小q的提问 同学得回答现在队伍里有多少人,还想知道队伍中最高的身高是多少。(想打架???。。。) 输入格式 Input Fo原创 2010-10-06 21:55:00 · 549 阅读 · 0 评论 -
hdu 3415 Max Sum of Max-K-sub-sequence 单调队列 求连续l(1<=l<=k)个数的和的最大值 数列可循环
Max Sum of Max-K-sub-sequence<br />Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)<br />Total Submission(s): 1188 Accepted Submission(s): 426<br /><br />Problem DescriptionGiven a circle sequence A[1],A[2],A[3]......A原创 2010-10-08 21:45:00 · 673 阅读 · 0 评论 -
joj 2660: 河床 求最长区间满足条件(0<=max-min<=k) 单调队列
<br /> 2660: 河床ResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE2s32768K36750Standard<br />地理学家对一段河床进行测量分析。他们从上游到下游等距离的选择了n(<=30000)个水位点深度。得到一组数据d1,d2...dn,且都是非负整数(di<=32767)。回到试验室后数据分析员根据需要对数据进行分析,发觉隐藏在数据背后的规律。最近,Dr.Sun 发现某种水文现象与河床地势有关,于是他指示分析员找出一段河流中最大高原创 2010-10-08 23:02:00 · 653 阅读 · 0 评论 -
2752 Seek the Name, Seek the Fame KMP 找出字符串中所有前缀-后缀的字符串
Seek the Name, Seek the FameTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 5391 Accepted: 2381<br />DescriptionThe little cat is so famous, that many couples tramp over hill and dale to Byteland, and asked the little cat to give names to their n原创 2010-10-09 11:40:00 · 478 阅读 · 0 评论 -
3080 Blue Jeans 求N个字符串的最长子串 暴力枚举+ KMP模板
Blue JeansTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4913 Accepted: 2033DescriptionThe Genographic Project is a research partnership between IBM and The National Geographic Society that is analyzing DNA from hundreds of thousands of contribu原创 2010-10-09 16:43:00 · 580 阅读 · 0 评论 -
1961 Period KMP 判断字符串最多由几部分组成
PeriodTime Limit: 3000MS Memory Limit: 30000K Total Submissions: 6214 Accepted: 2653 DescriptionFor each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether th原创 2010-10-09 11:24:00 · 366 阅读 · 0 评论 -
2104 K-th Number 求任一区间的第k小数 线段树+划分树
K-th NumberTime Limit: 20000MS Memory Limit: 65536KTotal Submissions: 21235 Accepted: 5681Case Time Limit: 2000MSDescriptionYou are working for Macrohard company in data structures department. After failing your previous task about key insertion you were a原创 2010-10-09 20:13:00 · 1064 阅读 · 0 评论 -
2833 The Average 求数组的前k小、大数 最大堆,最小堆 STL
The AverageTime Limit: 6000MS Memory Limit: 10000KTotal Submissions: 7095 Accepted: 2184Case Time Limit: 4000MSDescriptionIn a speech contest, when a contestant finishes his speech, the judges will then grade his performance. The staff remove the highest g原创 2010-10-10 16:50:00 · 762 阅读 · 0 评论 -
tyvj 1305 最大m子段和 单调队列 求连续l(1<=l<=k)个数的和的最大值 数列不可循环
FromAdmin☆最大子序和 描述 Description 输入一个长度为n的整数序列,从中找出一段不超过M的连续子序列,使得整个序列的和最大。<br /><br />例如 1,-3,5,1,-2,3<br /><br />当m=4时,S=5+1-2+3=7<br />当m=2或m=3时,S=5+1=6 输入格式 Input Format 第一行两个数n,m<br />第二行有n个数,要求在n个数找到最大子序和 输出格式 Output Format原创 2010-10-25 21:12:00 · 1952 阅读 · 1 评论 -
1400 Complicated Expressions 中缀转后缀 后缀转中缀 去除中缀表达式中的多余括号
Complicated ExpressionsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 911 Accepted: 329<br />DescriptionThe most important activity of ACM is the GSM network. As the mobile phone operator, ACM must build its own transmitting stations. It is very原创 2010-11-02 11:29:00 · 1065 阅读 · 0 评论 -
poj 2513 Colored Sticks 并查集+Ties+欧拉回路
Colored SticksTime Limit: 5000MS Memory Limit: 128000KTotal Submissions: 18516 Accepted: 4808<br />DescriptionYou are given a bunch of wooden sticks. Each endpoint of each stick is colored with some color. Is it possible to align the sticks in a straight l原创 2011-03-03 14:44:00 · 483 阅读 · 0 评论 -
hdu 3724 Encoded Barcodes Ties树 求X的个数(A是X的前缀)
Encoded BarcodesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 92 Accepted Submission(s): 38Problem DescriptionAll the big malls need a powerful system for the products retrieval. Now you are empl原创 2011-03-03 17:24:00 · 953 阅读 · 0 评论 -
poj 3630 Phone List Ties树 判断是否存在前缀码 Ties树不用new 否则超时
Phone ListTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10252 Accepted: 3295<br />Description<br />Given a list of phone numbers, determine if it is consistent in the sense that no number is the prefix of another. Let's say the phone catalogue原创 2011-03-03 16:14:00 · 838 阅读 · 0 评论 -
poj 1056 判断前缀码
IMMEDIATE DECODABILITYTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6984 Accepted: 3349<br />DescriptionAn encoding of a set of symbols is said to be immediately decodable if no code for one symbol is the prefix of a code for another symbol. We原创 2011-03-04 09:24:00 · 798 阅读 · 0 评论 -
HASH 题目汇总 转载自hqd_acm 膜拜hqd神牛
<br /><br />挺喜欢hash的,可能是因为hash的运用比较灵活吧。现在对就对ac的几个题做个分类。<br />大整数的hash,含多个整数(这类题的hash函数比较灵活)<br />poj2875 poj1840 poj3640 poj3349<br />poj2002 key=(abs(p[i].x)*99983+abs(p[i].y)*13)%77777;<br />poj1200 (将字符串看成26进制数)<br />字符串的hash(有许多现成函数,选择合适的就行)<br />po转载 2011-03-04 11:06:00 · 804 阅读 · 0 评论 -
最长重复子串(可重复) 后缀数组
最长重复子串时间限制:1000 ms | 内存限制:3000 KB 描述 对于一个字符串S1,其中S2是他的一个子串(长度严格小于S1长度),如果S2在S1中出现次数超过1次,那么S2就是一个重复子串,现在的要求是给定S1,请求出他的最长重复子串;如果有多个长度一样的最长子串,请输入字典序最小那个串;比如bbbaaaccc那么最长子串就是aa输入 第一行包含一个整数T,表示有T组数据对于每组数据包含一行,该行有一个字符串,长度小于10,000输出 对于每组数据请输出他的最长重复子串,保证每组数据都有;样原创 2011-03-08 20:03:00 · 2506 阅读 · 2 评论 -
Distinct Substrings 给出一个字符串,问它的不重复子串有多少个 后缀数组
694. Distinct SubstringsProblem code: DISUBSTR<br /> <br />Given a string, we need to find the total number of its distinct substrings.Input<br />T- number of test cases. T<=20;<br />Each test case consists of one string, whose length is <= 1000Output<br /原创 2011-03-08 19:01:00 · 774 阅读 · 0 评论 -
pku 1743 Musical Theme 最长重复不重叠子串 后缀数组
<br />Musical ThemeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 7145 Accepted: 2539<br />DescriptionA musical melody is represented as a sequence of N (1<=N<=20000)notes that are integers in the range 1..88, each representing a key on the pian原创 2011-03-11 21:15:00 · 586 阅读 · 0 评论