
RMQ
文章平均质量分 88
Mr_Treeeee
这个作者很懒,什么都没留下…
展开
-
HDU 3183 A Magic Lamp (RMQ)
A Magic LampTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4268 Accepted Submission(s): 1765Problem DescriptionKiki likes tr原创 2017-07-31 23:14:53 · 313 阅读 · 0 评论 -
HDU Find the hotel(RMQ)
Find the hotelTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 611 Accepted Submission(s): 201Problem Description Summer agai原创 2017-08-01 18:53:57 · 379 阅读 · 0 评论 -
HDU 3486 Interviewe(RMQ+二分)
IntervieweTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7343 Accepted Submission(s): 1753Problem DescriptionYaoYao has a co原创 2017-08-01 19:00:32 · 389 阅读 · 0 评论 -
HDU 2888 Check Corners(二维RMQ)
Check CornersTime Limit: 2000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3063 Accepted Submission(s): 1100Problem DescriptionPaul draw a原创 2017-08-01 23:02:41 · 384 阅读 · 0 评论 -
UVA 12338 - Anti-Rhyme Pairs(后缀数组+RMQ)
UVA - 12338 可点击。题意:给你n个字符串,q个查询,每个查询问两个字符串的最长公共前缀是几。POINT:后缀数组,把几个字符串合起来。然后RMQ heght数组。注意答案不能超过min(两个字符串的长度)。先给ans赋值一个上限。在去query查询。#include #include #include #include #incl原创 2017-09-26 23:42:45 · 344 阅读 · 0 评论