数据结构
文章平均质量分 70
1A_coder
Just for fun!
展开
-
hdu 4217 Data Structure?
http://acm.hdu.edu.cn/showproblem.php?pid=4217 Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2251 Accepted Submission(s): 711原创 2013-11-16 12:12:09 · 787 阅读 · 0 评论 -
poj 1151 Atlantis (线段树+扫描线+离散化)
AtlantisTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 18061 Accepted: 6873DescriptionThere are several ancient Greek texts that contain descriptions of the fabled island Atlantis. Some of ...原创 2014-12-08 11:32:04 · 1020 阅读 · 0 评论 -
hdu 2838 Cow Sorting(树状数组)
Cow SortingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2239 Accepted Submission(s): 711Problem DescriptionSherlock's N (1原创 2014-07-23 18:48:50 · 1138 阅读 · 0 评论 -
poj 2528 Mayor's posters (线段树+区间离散)
Mayor's postersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 45031 Accepted: 13080DescriptionThe citizens of Bytetown, AB, could not stand that the原创 2014-12-06 11:39:24 · 704 阅读 · 0 评论 -
hdu 1754 I Hate It
Problem - 1754 http://acm.hdu.edu.cn/showproblem.php?pid=1754 Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 29644 Accepted Submissi原创 2013-11-14 11:42:32 · 744 阅读 · 0 评论 -
hdu 5124 lines (线段树+离散化)
linesTime Limit: 5000/2500 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 620 Accepted Submission(s): 288Problem DescriptionJohn has several lines原创 2014-12-01 21:52:12 · 884 阅读 · 3 评论 -
Fenwick tree (CF Educational Codeforces Round 10)
D. Nested Segmentstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given n segments on a line. Ther原创 2016-04-26 16:58:12 · 345 阅读 · 0 评论 -
poj 3368 Frequent values (RMQ或线段树)
Frequent valuesTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 16959 Accepted: 6125DescriptionYou are given a sequence of n integers a1 , a2 , ... , a原创 2016-08-01 10:15:10 · 1657 阅读 · 0 评论 -
hdu 1541 Stars(模板)
StarsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4402 Accepted Submission(s): 1748Problem DescriptionAstronomers often ex原创 2014-07-19 14:55:37 · 745 阅读 · 0 评论 -
G. Xor-MST (分治+Trie树)
G. Xor-MSTtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a complete undirected graph with n vertices. A number ai is assigned to ea...原创 2018-07-10 19:09:12 · 738 阅读 · 0 评论 -
二叉树的非递归遍历 (leetcode 104.二叉树的最大深度)
二叉树前序遍历:先访问根结点,然后右子树入栈,最后左子树入栈;#define mp make_pairclass Solution {public: int maxDepth(TreeNode* root){ stack<pair<TreeNode*,int> >s; s.push(mp(root,1)); ...原创 2018-07-25 20:46:43 · 981 阅读 · 0 评论 -
poj 2299 Ultra-QuickSort
Ultra-QuickSortTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 38588 Accepted: 13903DescriptionIn this problem, you have to analyze a particular sorti原创 2014-04-29 16:42:30 · 664 阅读 · 0 评论 -
hdu 1698 Just a Hook (成段更新+总区间求和)
Just a HookTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 18411 Accepted Submission(s): 9231Problem DescriptionIn the game o原创 2014-11-30 22:32:47 · 608 阅读 · 0 评论 -
poj 2777 Count Color (成段更新+区间求和)
Count ColorTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 36646 Accepted: 11053DescriptionChosen Problem Solving and Program design as an optional co原创 2014-11-30 23:21:10 · 826 阅读 · 0 评论 -
poj 3667 Hotel
HotelTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 10959 Accepted: 4732DescriptionThe cows are journeying north to Thunder Bay in Canada to gain cul原创 2014-05-21 12:13:49 · 800 阅读 · 0 评论 -
hdu 1686 Oulipo (KMP模板)
OulipoTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4187 Accepted Submission(s): 1660Problem DescriptionThe French author G原创 2014-05-10 18:32:30 · 776 阅读 · 0 评论 -
KMP算法
KMP是一个高效的字符串匹配算法,它是由三位计算机学者 D.E.Knuth 与 V.R.Pratt 和 J.H.Morris 同时发现的,因此人们通常简称它为 KMP 算法。可以证明它的时间复杂度为O(m+n),直观地看,是因为在匹配过程中指针 i 没有回溯。KMP算法的核心思想是利用已经得到的部分匹配信息来进行后面的匹配过程。一般匹配算法中,进行"两个子串的比较"过程中,不管是T串的第几转载 2014-05-10 18:27:14 · 558 阅读 · 0 评论 -
poj 2823 Sliding Window
Sliding WindowTime Limit: 12000MS Memory Limit: 65536KTotal Submissions: 36147 Accepted: 10700Case Time Limit: 5000MSDescriptionAn array of size n ≤ 106 i原创 2014-04-28 11:01:54 · 878 阅读 · 0 评论 -
hdu 4046 Panda
题意:即3个连续的wbw算是一个love,看一下某个区间共有多少个love,多次询问。还有替换某个位置的字母,然后询问。用树状数组处理,题目并不难,但因为一处想当然错了N次。。。题目链接:Panda#include"stdio.h"#include"string.h"#define N 50005#define lowbit(i) (i&(-i))char str[原创 2014-07-20 12:57:33 · 694 阅读 · 0 评论 -
poj 3468 A Simple Problem with Integers
A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 55626 Accepted: 16755Case Time Limit: 2000MSDescriptionYou have N原创 2014-04-28 09:19:03 · 658 阅读 · 0 评论 -
hdu 1075 What Are You Talking About(字典树)
http://acm.hdu.edu.cn/showproblem.php?pid=1075 What Are You Talking AboutTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 102400/204800 K (Java/Others)Total Submission(s): 11207 Acc转载 2013-11-20 20:29:55 · 889 阅读 · 0 评论 -
poj 3264 Balanced Lineup
Balanced LineupTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 32070 Accepted: 15090Case Time Limit: 2000MSDescriptionFor the daily milking, Far原创 2014-04-27 21:33:31 · 736 阅读 · 0 评论 -
hdu 5023 A Corrupt Mayor's Performance Art (线段树+区间更新+状压)
A Corrupt Mayor's Performance ArtTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 100000/100000 K (Java/Others)Total Submission(s): 699 Accepted Submission(s): 267Problem Descrip原创 2014-09-24 15:57:05 · 851 阅读 · 0 评论 -
hdu 1166 敌兵布阵 (简单线段树)
http://acm.hdu.edu.cn/showproblem.php?pid=1166 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 32982 Accepted Submission(s): 14138原创 2013-11-16 16:29:00 · 852 阅读 · 0 评论 -
重建二叉树(根据前序遍历和中序遍历构建二叉树)
题目描述输入某二叉树的前序遍历和中序遍历的结果,请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6},则重建二叉树并返回。思路:1.前序遍历的第一个节点一定是根结点。前序遍历的一个节点要么是相邻前一个节点的左子树、右子树或者更靠近前面节点的右子树。如何确定前后相邻两...原创 2018-08-08 13:07:05 · 4400 阅读 · 0 评论