Submit | All submissions | Best solutions | Back to list |
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
Added by: | Nguyen Dinh Tu |
Date: | 2006-11-01 |
Time limit: | 1s |
Source limit: | 5000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ERL JS-RHINO NODEJS PERL6 VB.NET |
hide comments
|
||||||||||||||
2015-07-10 19:15:50 scyth3r
no AC Python submission..... :< |
||||||||||||||
2015-07-08 09:03:37 Aman Agarwal
learned pretty nice things from this questions..Thnx for setting such a problem |
||||||||||||||
2015-06-29 04:47:11
TLE for Java code, using Kadane's algorithm, any suggestions to make it pass? |
||||||||||||||
2015-06-25 21:10:20 Arjun Verma
c++ , use scanf/printf |
||||||||||||||
2015-06-18 13:26:20 Abhishek pratap singh
@NITIKA Increase your tree array size. |
||||||||||||||
2015-06-16 23:14:22 Deepak Singh Tomar
segment_tree#1 |
||||||||||||||
2015-06-15 10:28:12 Liquid_Science
Very stringent time limit for java programmers ,I guess that explains why around 15 java solution till now , Time limits should be seriously reconsidered to give other language programmers a chance |
||||||||||||||
2015-06-13 20:54:07
@anando_du : ans should be 118 for this case no?? can you please explain how did you get 111?? Last edit: 2015-06-13 20:55:32 |
||||||||||||||
2015-06-11 19:29:37 anando_du
test case: 5 3 -10 100 -2 20 1 1 5 output: 118 Last edit: 2015-07-08 08:28:54 |
||||||||||||||
2015-06-08 10:49:52 dastanforever
WA on judge 9:( |