GSS5  Can you answer these queries V
You are given a sequence A[1], A[2], ..., A[N] . ( A[i] <= 10000 , 1 <= N <= 10000 ). A query is defined as follows: Query(x1,y1,x2,y2) = Max { A[i]+A[i+1]+...+A[j] ; x1 <= i <= y1 , x2 <= j <= y2 and x1 <= x2 , y1 <= y2 }. Given M queries (1 <= M <= 10000), your program must output the results of these queries.
Input
The first line of the input consist of the number of tests cases <= 5. Each case consist of the integer N and the sequence A. Then the integer M. M lines follow, contains 4 numbers x1, y1, x2 y2.
Output
Your program should output the results of the M queries for each test case, one query per line.
Example
Input: 2 6 3 2 1 4 5 2 2 1 1 2 3 1 3 2 5 1 1 1 1 1 1 1 Output: 2 3 1
hide comments
computer_argha:
20181024 13:54:40
Though the problem statement states that the size of the array is less than or equal 10000 but test cases have array size more than that so take a larger sized array to solve the problem 

tanardi gunawan:
20181003 13:06:30
Last edit: 20181003 13:11:28 

shizukaa:
20180805 06:25:33
My first ac in one go! 

kishore_p:
20180719 17:23:47
AC in one Go :)


rkocharyan:
20180320 09:59:57
@alexandro5432 Yes, Abelyan Last edit: 20180320 10:00:15 

alexandro5432:
20180315 15:08:15
shakil0302 y1 is a constant name in library cmath. Thats why you are getting compile errors. 

shakil0302:
20170923 08:25:25
Anybody tried 'long long y1' as variable? Costs me 2 compiler error!! 

beginner_1998:
20170914 00:02:31
weak test cases


shahidul_brur:
20161113 12:21:52
why for the first query (i.e. 1 1 2 3) ans is 2 ?


Ashwani Gautam:
20160923 01:28:28
no need to use scanf and printf, if you are using the "data structure" neatly ;) 
Added by:  Frank Rafael Arteaga 
Date:  20080806 
Time limit:  0.132s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: C99 ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  K.Y. Chen and K.M. Chao, On the Range MaximumSum Segment Query Problem, 2007. 