![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数据结构
文章平均质量分 82
Tyuio28
这个作者很懒,什么都没留下…
展开
-
hdu5652 India and China Origins(并查集)
India and China Origins Accepts: 49 Submissions: 426 Time Limit: 2000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)问题描述很久以前,中国和印度之间并没有喜马拉雅山相隔,两国的文化交流很频繁。原创 2016-03-27 13:00:41 · 799 阅读 · 0 评论 -
POJ 3261 可重叠k次最长重复子串
Milk PatternsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 13127 Accepted: 5842Case Time Limit: 2000MSDescriptionFarmer John has noticed that原创 2016-04-06 21:42:33 · 846 阅读 · 0 评论 -
POJ 1743 后缀数组
Musical ThemeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 24507 Accepted: 8259DescriptionA musical melody is represented as a sequence of N (1<=N<=原创 2016-04-06 21:40:12 · 565 阅读 · 0 评论 -
hdu 3436 splay树+离散化*
Queue-jumpersTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3139 Accepted Submission(s): 848Problem DescriptionPonyo and Gar原创 2016-02-24 21:02:31 · 422 阅读 · 0 评论 -
hdu 4453 splay
LooploopTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1651 Accepted Submission(s): 517Problem DescriptionXXX gets a new toy原创 2016-02-24 21:00:37 · 327 阅读 · 0 评论 -
hdu 1890 splay树
Robotic SortTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3340 Accepted Submission(s): 1423Problem DescriptionSomewhere dee原创 2016-02-24 20:58:09 · 342 阅读 · 0 评论 -
hdu3487 splay树
Play with ChainTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5426 Accepted Submission(s): 2185Problem DescriptionYaoYao is原创 2016-02-24 20:55:21 · 493 阅读 · 0 评论 -
poj3580 splay树 REVOVLE循环
SuperMemoTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 12795 Accepted: 3989Case Time Limit: 2000MSDescriptionYour friend, Jackson is invited t原创 2016-02-21 07:25:05 · 588 阅读 · 0 评论 -
zoj2112 树状数组+主席树 区间动第k大
Dynamic RankingsTime Limit: 10000MS Memory Limit: 32768KB 64bit IO Format: %lld & %lluSubmit StatusDescriptionThe Company Dynamic Rankings has developed a new k原创 2016-02-21 07:21:34 · 551 阅读 · 0 评论 -
SPOJ - DISUBSTR 多少个不同的子串
694. Distinct SubstringsProblem code: DISUBSTR Given a string, we need to find the total number of its distinct substrings.InputT- number of test cases. TEach te原创 2016-04-06 21:45:16 · 792 阅读 · 0 评论 -
URAL 1297 最长回文子串(后缀数组)
1297. PalindromeTime limit: 1.0 secondMemory limit: 64 MBThe “U.S. Robots” HQ has just received a rather alarming anonymous letter. It states that the agent from the competing «Robots Un原创 2016-04-06 21:46:51 · 725 阅读 · 0 评论 -
算法合集之《后缀数组——处理字符串的有力工具》
后缀数组:sa[i]:表示排名第i个的首字母位置Rank[i]:第i个数的排名Height[i]:sa[i]和sa[i-1]的最长公共前缀1.不可重叠最长重复子串(pku1743)给你一串数字,求它们最长的重复(公差相同)子序列,且两个子序列不相交我们可以向二分枚举ans长度,如果能找到两个height>=ans,而且通过sa判断两个的间接>=ans,则说明原创 2016-04-06 22:25:49 · 622 阅读 · 0 评论 -
hdu5558 后缀数组
Alice's Classified MessageTime Limit: 16000/8000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 308 Accepted Submission(s): 118Problem Description原创 2016-04-06 22:33:47 · 1235 阅读 · 0 评论 -
poj2406 连续重复子串
Power StringsTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 41110 Accepted: 17099DescriptionGiven two strings a and b we define a*b to be their conca原创 2016-04-06 22:18:49 · 987 阅读 · 0 评论 -
poj 3693 后缀数组 重复次数最多的连续重复子串
Maximum repetition substringTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8669 Accepted: 2637DescriptionThe repetition number of a string is defined原创 2016-04-06 22:16:00 · 494 阅读 · 0 评论 -
SPOJ PHRASES 每个字符串至少出现两次且不重叠的最长子串
DescriptionYou are the King of Byteland. Your agents have just intercepted a batch of encrypted enemy messages concerning the date of the planned attack on your island. You immedietaly send for原创 2016-04-06 22:13:27 · 1140 阅读 · 1 评论 -
POJ 3294 n个串中至少一半的串共享的最长公共子串
Life FormsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 12484 Accepted: 3502DescriptionYou may have wondered why most extraterrestrial life forms re原创 2016-04-06 22:10:26 · 548 阅读 · 0 评论 -
POJ 3415 不小于k的公共子串的个数
Common SubstringsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 9248 Accepted: 3071DescriptionA substring of a string T is defined as:T(i, k)=TiT原创 2016-04-06 21:53:31 · 638 阅读 · 0 评论 -
poj 2774 最长公共子串 后缀数组
Long Long MessageTime Limit: 4000MS Memory Limit: 131072KTotal Submissions: 25752 Accepted: 10483Case Time Limit: 1000MSDescriptionThe little cat is major原创 2016-04-06 21:48:19 · 584 阅读 · 0 评论 -
SPOJ COT(树上的点权第k大)
Count on a treeTime Limit: 129MS Memory Limit: 1572864KB 64bit IO Format: %lld & %lluSubmit StatusDescriptionYou are given a tree with N nodes.The tree nodes原创 2016-02-18 21:55:34 · 470 阅读 · 0 评论 -
poj 2104 主席树(区间第k大)
K-th NumberTime Limit: 20000MS Memory Limit: 65536KTotal Submissions: 44940 Accepted: 14946Case Time Limit: 2000MSDescriptionYou are working for Macrohard原创 2016-02-18 21:51:39 · 374 阅读 · 0 评论 -
poj3237 树链部分 边权模板
TreeTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 7384 Accepted: 2001DescriptionYou are given a tree with N nodes. The tree’s nodes are numbered 1原创 2016-02-18 21:25:33 · 386 阅读 · 0 评论 -
hdu 5573Binary Tree
Binary TreeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 251 Accepted Submission(s): 143Special JudgeProblem DescriptionThe原创 2015-12-23 18:45:39 · 609 阅读 · 0 评论 -
2015陕西 并查集
某国家的网络传输系统可以看作是以首都Town为中心的有向树,一开始只是Town建有基站,所有其他城市的信号全是从Town传输过来的,现在他们开始在其他城市建立基站,城市的编号为1->n;其中城市1为首都,"C x"代表在城市x处建立基站,Q代表询问。输入:每组数据包含2个正整数n和m(1输出:对于每个查询输出一个数样例: 3 4 1 2原创 2015-06-14 10:58:17 · 926 阅读 · 0 评论 -
hdu 5441 (并查集)
题意:给你n个点,m条边构成无向图。q个询问,每次一个值,求有多少条路,路中的边权都小于这个值a->b 和 b->a算两种思路:把权值从小到大排序,询问从小到大排序,如果相连则用并查集相连形成联通块x个点可以形成:x * (x - 1)如果新增的路使两个联通块和并则数量 增长了:(num[1]+num[2])×(num[1]+num[2]-1) - num[1] × (num[原创 2015-09-15 11:41:26 · 443 阅读 · 0 评论 -
拓扑
简单拓扑排序 1.找出入度为零的那个数并用数组或者队列记录 2.这个数指向的那些数的入度减1通过入度的大小来判断其可能所在的位置。 在输入的时候进行判断,若A->B,则B的入度增加void topsort() { int head_=1,tail=0; for(int i=1;i<=n;i++) if原创 2015-06-22 20:48:46 · 579 阅读 · 0 评论 -
hdu 5438(拓扑+bfs)
题意:建图,删掉所有连接点小于2的点,直到不能删为止,问最后剩余的联通块中,点的数量是奇数的联通块中的点的权值和。思路:拓扑删点,bfs计算#include #include #include #include #include using namespace std;typedef long long ll;vectorq[10005];int p[100原创 2015-09-13 23:14:10 · 494 阅读 · 0 评论 -
最小公共祖先 (Tarjan) POJ1470
POJ 1470标准的LCA,输入感觉怪怪的=.=自己看了下Tarjan,再参考了下别人的处理方法#include #include #include #include using namespace std;const int N = 1010;const int M = 1000010;int in[N], par[N], ans[N];bool vis转载 2015-06-28 17:18:52 · 571 阅读 · 0 评论 -
POJ2513 欧拉 + 字典树
POJ 2513有N根木棒,一根木棒有2头,我们把每头涂色(相同或不同),如果2根木棒有相同颜色的一端就可以连接,颜色全部不同就不能连接,现在给你N根木棒以及它们的颜色,问最后能不能链接成1条链。欧拉回路的问题,判断联通 以及 奇点个个数输入为字符串,开始并不知道怎么弄,参考了下别人的报告,用字典树处理(学到的新东西),#include#include#incl原创 2015-06-22 23:40:56 · 480 阅读 · 0 评论 -
2015 多校联赛 ——HDU5350(huffman)
Problem DescriptionMZL is a mysterious mathematician, and he proposed a mysterious function at his young age.Stilwell is very confused about this function, and he need your help.First of all,原创 2015-08-04 22:33:00 · 1178 阅读 · 0 评论 -
hdu 2665 划分树
Kth numberTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7616 Accepted Submission(s): 2402Problem DescriptionGive you a seq原创 2016-01-29 01:14:18 · 294 阅读 · 0 评论 -
hdu 4251 划分树
The Famous ICPC Team AgainTime Limit: 30000/15000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1155 Accepted Submission(s): 561Problem Description原创 2016-01-29 01:17:20 · 366 阅读 · 0 评论 -
poj 2019 二维RMQ
CornfieldsTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 6169 Accepted: 3039DescriptionFJ has decided to grow his own corn hybrid in order to help th原创 2016-02-18 21:21:06 · 687 阅读 · 0 评论 -
hdu3966 点权模板-树链部分
Aragorn's StoryTime Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7495 Accepted Submission(s): 1967Problem DescriptionOur prota原创 2016-02-18 21:17:49 · 342 阅读 · 0 评论 -
hdu 4123 树的最长路+RMQ
Bob’s RaceTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3034 Accepted Submission(s): 991Problem DescriptionBob wants to hol原创 2016-02-17 21:22:58 · 468 阅读 · 0 评论 -
hdu3183 RMQ
A Magic LampTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2742 Accepted Submission(s): 1071Problem DescriptionKiki likes tr原创 2016-02-17 21:19:32 · 426 阅读 · 0 评论 -
hdu 2888 二维RMQ模板题
Check CornersTime Limit: 2000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2377 Accepted Submission(s): 859Problem DescriptionPaul draw a原创 2016-02-17 21:16:27 · 379 阅读 · 0 评论 -
hdu 1806 RMQ
Frequent valuesTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1459 Accepted Submission(s): 535Problem DescriptionYou are giv原创 2016-01-29 05:10:06 · 391 阅读 · 0 评论 -
hdu 4417 划分树
Super MarioTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4041 Accepted Submission(s): 1862Problem DescriptionMario is world原创 2016-01-29 03:09:21 · 302 阅读 · 0 评论 -
hdu 3473 划分树
Minimum SumTime Limit: 16000/8000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3611 Accepted Submission(s): 829Problem DescriptionYou are given原创 2016-01-29 01:24:31 · 528 阅读 · 0 评论