GSS1 - Can you answer these queries I


You are given a sequence A[1], A[2], ..., A[N] . ( |A[i]| ≤ 15007 , 1 ≤ N ≤ 50000 ). A query is defined as follows:
Query(x,y) = Max { a[i]+a[i+1]+...+a[j] ; x ≤ i ≤ j ≤ y }.
Given M queries, your program must output the results of these queries.

Input

  • The first line of the input file contains the integer N.
  • In the second line, N numbers follow.
  • The third line contains the integer M.
  • M lines follow, where line i contains 2 numbers xi and yi.

Output

    Your program should output the results of the M queries, one query per line.

Example

Input:
3 
-1 2 3
1
1 2
Output:
2

hide comments
rahulpadhy: 2016-05-20 12:47:39

Can anybody please suggest as to where am I going wrong ?
http://pastebin.com/dtKe4rx4

oalieno: 2016-05-11 15:43:27

Did anyone use Treap to solve this problem?
I keep getting TLE using Treap...(sad...)

mars_ch: 2016-05-02 08:34:46

同意楼上!!

yousiki: 2016-05-01 05:38:06

TL is too strict

yousiki: 2016-05-01 02:39:43

Last edit: 2016-05-01 05:37:06
man: 2016-04-29 23:41:31

hell of a problem!! . confidence growing in segment trees

Gag: 2016-04-25 15:00:46

n<=500002

geekyadity: 2016-04-14 15:04:18

Use printf, scanf. ( sync_with_stdio(false) ) gives TLE with the same code

a_b_c12345: 2016-04-10 09:16:53

yoo..!! after 2 WA and 2 TLE finally accepted. To get AC from TLE just changed input array and tree into global.

KAUSHAL AGRAWAL: 2016-02-29 21:09:11

my first official Seg Tree submission :)
Got WA, then TLE, then CE, and finally AC in 4th attempt :D

Last edit: 2016-02-29 21:10:10

Added by:Nguyen Dinh Tu
Date:2006-11-01
Time limit:0.115s-0.230s
Source limit:5000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ERL JS NODEJS PERL 6 VB.net