ACM_RMQ
defense881
Noting is impossiable!Believe in yourself!
展开
-
RMQ and LCA
原帖地址:http://www.topcoder.com/tc?module=Static&d1=tutorials&d2=lowestCommonAncestor#Range_Minimum_Query_%28RMQ%29RMQ(Range Minimal Query)问题 给定一个数组A[1..N],RMQ(A,i,j)就是A[i..j]的最小值的下标。转载 2014-09-23 18:34:26 · 6820 阅读 · 0 评论 -
poj 3368(RMQ)Frequent values
Frequent values点击打开题目链接Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 13414 Accepted: 4936DescriptionYou are given a sequence of n integers a1 , a2原创 2014-09-26 09:42:54 · 734 阅读 · 0 评论