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
anubhav25: 2017-10-09 08:35:26

Finally did it ::)

striver_79: 2017-10-05 22:46:24

my first in segment tree!

pratham_1: 2017-10-02 16:15:27

@admin I think you must add JAVA in the list of unsupported languages as well

pratham_1: 2017-10-02 13:41:52

@swas99 I managed to use Fast IO keeping the source limit<5000B but the time limit is too strict for java

soham_12345: 2017-09-30 14:56:43

can anyone help me with testcase 9? :( I don't know why its failing

darkdreamofmy1: 2017-09-28 20:02:27

@ kaushal101 always take the value in leaf node not max(0,A[L])

javafreak: 2017-09-28 02:05:24

Finally solved it :) :) Feels good, use scanf , printf , cin and cout will not work even on using sync_with_stdio(false), will have to implement segment trees using pointers as array implementation would be complicated and memory consuming , finally don't give up, its a beautiful problem on segment trees will teach you a lot.

kapildeshpande: 2017-09-15 20:44:18

Finally solved it!

harshpreet: 2017-09-07 18:58:57

used scanf ,printf and segment trees with 4 values in the node still getting WA on test case 9.
When no overlap is returning value -15008 sufficient??
please help !!!!

Last edit: 2017-09-07 19:00:45
dhruv19: 2017-08-21 16:27:15

Use scanf printf and shift operator instead of division by 2

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