摘要:
In the traditional RMQ (Range Minimum Query) problem, we have a static array A. Then for each query (L, R) (L<=R), we report the minimum value among A 阅读全文
摘要:
Til the Cows Come HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 57202 Accepted: 19436DescriptionBessie is out in the field and wants t... 阅读全文
摘要:
One day , Kiki wants to visit one of her friends. As she is liable to carsickness , she wants to arrive at her friend’s home as soon as possible . Now... 阅读全文
摘要:
In this problem, a dictionary is collection of key-value pairs, where keys are lower-case letters, and values are non-negative integers. Given an old 阅读全文
摘要:
Bobo has a balanced parenthesis sequence P=p 1 p 2…p n of length n and q questions. Bobo has a balanced parenthesis sequence P=p 1 p 2…p n of length n 阅读全文