RMQ | LCA | 倍增
CrossDolphin
青春看起来如此完美,没空闲去浪费时间。
展开
-
vijos 1514 RMQ
链接:https://vijos.org/p/1514描述从前有个人名叫W and N and B,他有着天才般的记忆力,他珍藏了许多许多的宝藏。在他离世之后留给后人一个难题(专门考验记忆力的啊!),如果谁能轻松回答出这个问题,便可以继承他的宝藏。题目是这样的:给你一大串数字(编号为1到N,大小可不一定哦!),在你看过一遍之后,它便消失在你面前,随后问题就出现了,给你M个询原创 2015-04-12 23:09:30 · 504 阅读 · 0 评论 -
2016百度之星 hdu 5696 RMQ+单调栈
链接:戳这里区间的价值Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Problem Description我们定义“区间的价值”为一段区间的最大值*最小值。一个区间左端点在L,右端点在R,那么该区间的长度为(R−L+1)。原创 2016-05-23 20:55:20 · 568 阅读 · 2 评论 -
Codeforces Round #361 (Div. 2) D RMQ+二分
链接:戳这里D. Friends and Subsequencestime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputMike and !Mike are old childhood rivals, they原创 2016-07-07 21:29:25 · 446 阅读 · 0 评论 -
2016 Multi-University Training Contest 1 1004 hdu 5726 二分+RMQ
链接:戳这里GCDTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Problem DescriptionGive you a sequence of N(N≤100,000) integers : a1,...,an(0 Inp原创 2016-07-19 17:24:55 · 663 阅读 · 0 评论 -
Educational Codeforces Round 15 E 树上倍增 RMQ思想
链接:戳这里E. Analysis of Pathes in Functional Graphtime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputYou are given a functional grap原创 2016-08-01 15:31:56 · 435 阅读 · 0 评论 -
Codeforces Round #294 (Div. 2) E 树上倍增lca
链接:戳这里E. A and B and Lecture Roomstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA and B are preparing themselves for programmi原创 2016-08-01 19:04:46 · 624 阅读 · 0 评论 -
hdu 2586 LCA
链接:戳这里How far away ?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Problem DescriptionThere are n houses in the village and some bidirection原创 2016-08-01 20:12:23 · 408 阅读 · 0 评论 -
hdu 5869 RMQ+二分+离线树状数组
链接:戳这里Different GCD Subarray QueryTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Problem DescriptionThis is a simple problem. The teacher give原创 2016-09-12 22:21:39 · 457 阅读 · 0 评论