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.


  • 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.


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


-1 2 3
1 2


hide comments
Abhishek Kainth: 2016-12-31 19:27:01

Got several WAs because of using int :/

yashar shahi: 2016-12-31 16:36:08

don't forget to use fast IO!!
I got one TLE because of not using fast IO!

siddharth_0196: 2016-12-27 16:04:20

When 1 typo leads to a series of WAs and TLEs. :/
Nice question though!

Rezaul H Sagar: 2016-12-25 20:30:16

What does Max { a[i]+a[i+1]+...+a[j]} mean? Range Maximum Query or Range Sum Query?

Abhishek Jaisingh: 2016-12-14 23:58:51

simple Segment Tree gives AC :)

Wumbolo: 2016-12-03 16:02:58

100th :Do GSS3 after this.

jawad_cs: 2016-11-18 08:42:40

taking size of array as 50000
and size of tree as 99999 (=2*50000-1)
gave me SEGSEV error

after increasing the sizes my solution got ac. Im curious to know why this thing happend. Can anyone please help me.

ryuga777: 2016-11-15 09:25:35

getting wrong answer on test case 9 .... tried almost everything... any help on corner case ??

kapoor_adhish: 2016-10-16 07:39:03

getting WA ....not TLE
using segtree....:(

i_dipu: 2016-10-07 12:35:30

used kadane algo for worst case scenario complexity is O(n*M), but TLE is the verdict !
how to improve this approach ? and also what is the limit of M ?

Last edit: 2016-10-07 13:23:13

Added by:Nguyen Dinh Tu
Time limit:0.115s-0.230s
Source limit:5000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ERL JS-RHINO NODEJS PERL6 VB.NET