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
3

Warning: large input/output data,be careful with certain languages

hide comments
subhram79788: 2020-07-05 14:27:40

given test case is wrong i think ;(

farhan132: 2020-05-11 14:41:17

Worst possible problem statement... I had to find the actual problem from the comments!

sakshamdrose: 2019-12-19 09:14:43

let's make clear what the problem is actually asking.

You are given a sequence of up to 100000 integers in the range [-100000, 100000]. You are also given up to 100000 queries. Each query names a nonempty slice of the sequence. For each query, return the maximum sum of a (possibly empty) slice of the given slice, where duplicate elements are ignored in the sum.

[Note: by "slice" we mean a contiguous subsequence. Slices of strings are substrings.]

[Note 2: Each query has a nonnegative answer since the sum of the empty slice is zero.]

sahil1422: 2019-12-11 10:31:22

So dreadful explanation. Admins, please look into the question.

Last edit: 2019-12-11 10:31:51
gmon20: 2019-08-27 19:38:20

Last edit: 2019-08-27 19:41:42
sharkert1k28: 2019-08-04 07:50:06

it's ez problem !

lightninguz: 2019-07-13 18:23:18

f**k...reading comprehension+data structure problem...u can see a lot of problems with horrible explanation like this in China...

george_123: 2019-07-12 08:36:59

hard to understand the problem

danos: 2019-07-03 08:32:57

Horrible explanation

intruder_p: 2019-06-22 16:45:46

My solution is failing again and again. Can anyone please provide some good sample test case?


Added by:Fudan University Problem Setters
Date:2007-05-16
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: C99 ERL JS-RHINO
Resource:Description, standard program and test data by Yang Zhe