GSS2  Can you answer these queries II
Being a completist and a simplist, kid Yang Zhe cannot solve but get Wrong Answer from most of the OI problems. And he refuse to write two program of same kind at all. So he always failes in contests.
When having a contest, Yang Zhe looks at the score of every problems first. For the problems of the same score, Yang Zhe will do only one of them. If he's lucky enough, he can get all the scores wanted.
Amber is going to hold a contest in SPOJ. She has made a list of N candidate problems, which fit Yang Zhe very well. So Yang Zhe can solve any problem he want. Amber lined up the problems, began to select. She will select a subsequence of the list as the final problems. Being A girl of great compassion, she'd like to select such a subsequence (can be empty) that Yang Zhe will get the maximal score over all the possible subsequences.
Amber found the subsequence easily after a few minutes. To make things harder, Amber decided that, Yang Zhe can take this contest only if Yang Zhe can answer her Q questions. The question is: if the final problems are limited to be a subsequence of list[X..Y] (1 <= X <= Y <= N), what's the maximal possible score Yang Zhe can get?
As we know, Yang Zhe is a bit idiot (so why did he solve the problem with a negative score?), he got Wrong Answer again... Tell him the correct answer!
Input
 Line 1: integer N (1 <= N <= 100000);
 Line 2: N integers denoting the score of each problem, each of them is a integer in range [100000, 100000];
 Line 3: integer Q (1 <= Q <= 100000);
 Line 3+i (1 <= i <= Q): two integers X and Y denoting the ith question.
Output
 Line i: a single integer, the answer to the ith question.
Example
Input: 9 4 2 2 3 1 4 2 2 6 3 1 2 1 5 4 9 Output: 4 5 3Warning: large input/output data,be careful with certain languages
hide comments
c_jain:
20171213 13:37:05
thanks Karol for Clarification :)


jatinjulu:
20171010 18:43:32
What a horrible way to write a question!!


weramajstor:
20170802 13:40:11
SAMOBOR,FUCK YEAH!!!! 

the_unbeatable:
20170623 13:04:02
@1729.000 she can only choose a subsequence, that is, a contiguous sequence, you can't just skip some of the elements 

krist7599555:
20170331 08:48:05
the best problem


aexpo:
20161216 16:11:30
Tricky test case:


aexpo:
20161216 16:07:01
One of the best questions on segment trees!


nurlansofiyev:
20160915 18:31:07
About IO : For the problems of the same score, Yang Zhe will do only one of them ! 

Zhouxing Shi:
20130422 23:52:45
subsequence? 

Ella:
20130306 03:33:27
Yes,I agree with you,Walrus.I think that amber choose a substring.It just means that if you want to get data from i to j,you cannot jump the over the negative score between i and j. 
Added by:  Fudan University Problem Setters 
Date:  20070516 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: C99 ERL JSRHINO 
Resource:  Description, standard program and test data by Yang Zhe 