数据结构
say_c_box
小白不能不努力~
展开
-
HDU3401 Trade (动态规划+单调队列)
/*知道之后n天的股票买卖价格(api,bpi),以及每天股票买卖数量上限(asi,bsi),问他最多能赚多少钱。开始时有无限本金,要求任两次交易需要间隔W天以上,即第i天交易,第i+w+1天才能再交易。同时他任意时刻最多只能拥有maxp的股票,容易写出DP方程 dp[i][j]=max{dp[i-1][j],max{dp[r][k]-APi[i]*(j-k)}(0j)} 分别是第i天不交易原创 2017-09-07 21:13:25 · 483 阅读 · 0 评论 -
codeforces 804B——Ice cream coloring(图论,dfs,数据结构,好题)
C. Ice cream coloringtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIsart and Modsart were trying to solv原创 2017-05-05 18:47:33 · 911 阅读 · 0 评论 -
codeforces 792D——Paths in a Complete Binary Tree(二叉树,数学)
D. Paths in a Complete Binary Treetime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputT is a complete binary t原创 2017-03-29 22:34:05 · 791 阅读 · 0 评论 -
Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals) 题解(ABCDE) (二分,dfs序,数据结构)
A. Andryusha and Sockstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAndryusha is an orderly boy and like原创 2017-03-07 19:59:05 · 522 阅读 · 0 评论 -
POJ3522——Slim Span(最小生成树)
Slim SpanTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 7908 Accepted: 4214DescriptionGiven an undirected weighted graph G, you should find one of sp原创 2017-02-26 15:03:42 · 367 阅读 · 0 评论 -
Gym101138J ————Valentina and the Gift Tree (树链剖分,区间最大子段和,线段树)
The Valentina's birthday is coming soon! Her parents love her so much that they are preparing some gifts to give her. Valentina is cute and smart and her parents are planning to set an interesting tas原创 2017-03-01 09:29:53 · 388 阅读 · 0 评论 -
Treap模板——POJ1442——Black Box
Black BoxTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 12151 Accepted: 4979DescriptionOur Black Box represents a primitive database. It can save an原创 2016-12-11 23:25:34 · 458 阅读 · 0 评论 -
HDU5923——Prediction(数据结构,并查集)
PredictionTime Limit: 5000/2500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 476 Accepted Submission(s): 109Problem DescriptionThere is a graph原创 2016-10-15 19:23:04 · 1533 阅读 · 0 评论 -
HDU4791——Alice's Print Service(线段树)
Alice's Print ServiceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2240 Accepted Submission(s): 589Problem DescriptionAlice原创 2016-10-15 11:00:43 · 387 阅读 · 0 评论 -
Codeforces Round #367 (Div. 2) D——Vasiliy's Multiset(异或字典树)
D. Vasiliy's Multisettime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAuthor has gone out of the stories ab原创 2016-08-12 13:45:33 · 877 阅读 · 0 评论 -
最优二叉查找树详解(算法导论学习笔记)
代码均未经过严格测试,仅供参考最优二叉查找树动态规划原理动态规划与分治法相似,都是通过组合子问题的解来求解原问题。动态规划通常是用来求解最优化问题(optimization problem).这类问题可以有很多个可行解,每个解都有一个值,我们希望寻找最优值(最大值或者最小值)的解。我们称这样的解为问题的一个最优解(oneoptimization solution)而不是最优解(theoptimiz原创 2017-06-08 09:04:14 · 20299 阅读 · 1 评论 -
codeforces 835C Star sky(二维树状数组)
C. Star skytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe Cartesian coordinate system is set in the s原创 2017-08-01 01:27:31 · 360 阅读 · 0 评论 -
HDU4912 Paths on the tree(数据结构,lca,贪心)
Paths on the treeTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1594 Accepted Submission(s): 552Problem Descriptionbobo ha原创 2017-07-24 09:03:28 · 304 阅读 · 0 评论 -
HDU6074 Phone Call(并查集,lca)
Phone CallTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 395 Accepted Submission(s): 163Problem DescriptionThere are n hou原创 2017-08-28 19:17:50 · 312 阅读 · 0 评论 -
codefcodeforces 845D Driving Test(栈)
Driving Testtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarp has just attempted to pass the drivin原创 2017-08-28 02:23:18 · 620 阅读 · 0 评论 -
HDU6059 Kanade's trio(异或字典树)
Kanade's trioTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 1067 Accepted Submission(s): 392Problem DescriptionGive you an原创 2017-08-27 14:49:05 · 396 阅读 · 0 评论 -
HDU6058 Kanade's sum(链表)
Kanade's sumTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2859 Accepted Submission(s): 1182Problem DescriptionGive you an a原创 2017-08-27 14:31:18 · 243 阅读 · 0 评论 -
倍增法求lca模板
/*倍增法求lca*/const int maxlogv=16;int f[maxlogv][MAXN];int dep[MAXN];//先dfsvoid lca_init(){ for(int k=0;k+1<maxlogv;++k){ for(int v=1;v<=n;++v){ if(f[k][v]==0) f[k+1][v]=0原创 2017-09-04 16:06:38 · 439 阅读 · 0 评论 -
HDU1890 Robotic Sort(slpay,区间旋转)
Robotic SortTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4395 Accepted Submission(s): 1966Problem DescriptionSomewhere dee原创 2017-07-28 21:38:15 · 334 阅读 · 0 评论 -
HYSBZ 1588: [HNOI2002]营业额统计(splay)
1588: [HNOI2002]营业额统计Time Limit: 5 Sec Memory Limit: 162 MBSubmit: 16609 Solved: 6663[Submit][Status][Discuss]Description营业额统计 Tiger最近被公司升任为营业部经理,他上任后接受公司交给的第一项任务便是统计并分析公司成立以来的营业情况。 Tige原创 2017-07-28 15:10:32 · 284 阅读 · 0 评论 -
HDU6035 Colorful Tree(树形dp)
Colorful TreeTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1152 Accepted Submission(s): 463Problem DescriptionThere is a原创 2017-07-26 17:21:41 · 1709 阅读 · 0 评论 -
codeforces 832D——Misha, Grisha and Underground(LCA)
D. Misha, Grisha and Undergroundtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMisha and Grisha are funny原创 2017-07-25 10:39:31 · 603 阅读 · 0 评论 -
HDU5818(多校第七场)——Joint Stacks(优先队列,左偏树)
Joint StacksTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 81 Accepted Submission(s): 29Problem DescriptionA stack is a data原创 2016-08-09 17:45:54 · 564 阅读 · 0 评论 -
HDU5444(2015长春网赛)——Elven Postman(树的遍历,dfs)
Elven PostmanTime Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1680 Accepted Submission(s): 959Problem DescriptionElves are v原创 2016-09-09 21:17:57 · 414 阅读 · 0 评论 -
POJ3221——Apple Tree(线段树,dfs序)
Apple TreeTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 25851 Accepted: 7665DescriptionThere is an apple tree outside of kaka's house. Every autumn,原创 2016-07-25 21:20:43 · 650 阅读 · 0 评论 -
POJ3250——Bad Hair Day(栈的应用)
Bad Hair DayTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 17352 Accepted: 5846DescriptionSome of Farmer John's N cows (1 ≤ N ≤ 80,000) are having a原创 2016-07-24 15:06:52 · 482 阅读 · 0 评论 -
POJ2559——Largest Rectangle in a Histogram(栈的应用)
Largest Rectangle in a HistogramTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 19094 Accepted: 6140DescriptionA histogram is a polygon composed of a原创 2016-07-24 11:23:07 · 427 阅读 · 0 评论 -
CodeForces 699D—— Fix a Tree(并查集判断环)
D. Fix a Treetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA tree is an undirected connected graph witho原创 2016-07-23 13:35:39 · 1371 阅读 · 0 评论 -
CodeForces 697C——Lorenzo Von Matterhorn(二叉树,map)
C. Lorenzo Von Matterhorntime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputBarney lives in NYC. NYC has infin原创 2016-07-23 13:26:14 · 436 阅读 · 0 评论 -
POJ1703——Find them, Catch them 并查集应用
Find them, Catch themTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 39239 Accepted: 12059DescriptionThe police office in Tadu City decides to say ends原创 2016-03-15 09:27:46 · 725 阅读 · 0 评论 -
POJ2236——Wireless Network 并查集应用
题目如下:Wireless NetworkTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 21254 Accepted: 8937DescriptionAn earthquake takes place in Southeast Asia原创 2016-03-15 08:59:17 · 532 阅读 · 0 评论 -
POJ1611——The Suspects 并查集基础
又一道并查集基础题题目如下:The SuspectsTime Limit: 1000MS Memory Limit: 20000KTotal Submissions: 30194 Accepted: 14684DescriptionSevere acute respiratory syndrom原创 2016-03-14 21:10:44 · 613 阅读 · 0 评论 -
POJ2524——Ubiquitous Religions 并查集基础
并查集的基础应用题目如下:DescriptionThere are so many different religions in the world today that it is difficult to keep track of them all. You are interested in finding out how many different reli原创 2016-03-14 20:56:11 · 475 阅读 · 0 评论 -
HDU1542——Atlantis(扫描线,线段树,矩形面积并,离散化)
I - AtlantisTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1542DescriptionThere are several ancient Greek texts that con原创 2016-07-25 21:27:57 · 389 阅读 · 0 评论 -
POJ3494——Largest Submatrix of All 1’s(栈的应用)
Largest Submatrix of All 1’sTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 5726 Accepted: 2150Case Time Limit: 2000MSDescriptionGiven a m-by-n原创 2016-07-24 16:28:16 · 537 阅读 · 0 评论 -
POJ3668——Frequent values(线段树,RMQ,ST表)
Frequent valuesTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit Status Practice POJ 3368DescriptionYou are given a sequence of n integers a1 ,原创 2016-07-25 22:17:55 · 758 阅读 · 0 评论 -
HDU5441(2015长春网赛)——Travel(并查集应用,离线处理)
TravelTime Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 3283 Accepted Submission(s): 1117Problem DescriptionJack likes to tra原创 2016-09-09 16:21:18 · 514 阅读 · 0 评论 -
HDU5792(2016多校第五场)——World is Exploding(树状数组,离散化)
World is ExplodingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 901 Accepted Submission(s): 423Problem DescriptionGiven a s原创 2016-08-07 16:57:32 · 401 阅读 · 0 评论 -
POJ1741——Tree(树上分治,树的重心)
TreeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 17804 Accepted: 5818DescriptionGive a tree with n vertices,each edge has a length(positive integer原创 2016-08-06 22:50:53 · 390 阅读 · 0 评论 -
SPOJ——QTREE2 - Query on a tree II(树链剖分或者倍增法)
DescriptionYou are given a tree (an undirected acyclic connected graph) with N nodes, and edges numbered 1, 2, 3...N-1. Each edge has an integer value assigned to it, representing its length.W原创 2016-08-06 22:37:16 · 970 阅读 · 0 评论