GSS5

https://www.spoj.pl/problems/GSS5/

SPOJ Problem Set (classical) 2916. Can you answer these queries V Problem code: GSS5

 

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

---

Added by:	Frank Rafael Arteaga
Date:	2008-08-06
Time limit:	1s
Source limit:	50000B
Languages:	All except: C99 strict ERL JS PERL 6
Resource:	K.-Y. Chen and K.-M. Chao, On the Range Maximum-Sum Segment Query Problem, 2007.

---

hide comments

2010-04-09 11:18:43 Ralf I keep getting timeouts for this problem when I test my solution. But I write an additional random line at the end, I get wrong answer in 0.02s. How could it timeout then?

2010-04-09 10:57:58 yuzeming if you get wa try it 1 5 -1 -1 -1 -1 -1 1 1 5 1 5 ans=-1 1 5 -1 -1 1 -1 -1 1 1 5 1 5 ans=1 Last edit: 2010-04-13 08:38:20

---

题意:给定一个序列a[i] 每次询问给出x1<=x2,y1<=y2,在[x1,x2]中找一个起点i,在[y1,y2]中找一个终点j,使得[i,j]的和最大

跟GSS1&GSS3还是相似,只要考虑x2和y1的关系 考虑区间相交或相离就行了...

{ SPOJ submission 4852994 (PAS fpc) plaintext list. Status: AC, problem GSS5, contest SPOJ. By hccz95 (HC), 2011-03-23 06:46:32. } const maxn = 10010 ; var tree : array[ 0..maxn*4 ] of record sum , max , Lmax , Rmax : Longint end; s : array[ 0..maxn ] of Longint ; n , m , t : Longint ; function maxi( a , b : Longint ) : Longint ; begin if a > b then exit( a ) else exit( b ); end; procedure build( v , L , R : Longint ); var m , Ls , Rs : Longint ; begin if L = R then begin with tree[ v ] do begin read( sum ); s[ L ] := s[ L - 1 ] + sum ; max := sum ; Lmax := sum ; Rmax := sum ; end; exit; end; m := ( L + R ) >> 1 ; Ls := v << 1 ; Rs := Ls + 1 ; build( Ls , L , m ); build( Rs , m+1 , R ); with tree[ v ] do begin sum := tree[ Ls ].sum + tree[ Rs ].sum ; max := maxi( maxi( tree[ Ls ].max , tree[ Rs ].max ) , tree[ Ls ].Rmax + tree[ Rs ].Lmax ); Lmax := maxi( tree[ Ls ].Lmax , tree[ Ls ].sum + tree[ Rs ].Lmax ); Rmax := maxi( tree[ Rs ].Rmax , tree[ Rs ].sum + tree[ Ls ].Rmax ); end; end; function count( v , L , R , a , b : Longint ; var Lmax , Rmax , sum : Longint ) : Longint ; var m , Ls , Rs : Longint ; Lmax1 , Rmax1 , sum1 , x1 : Longint ; Lmax2 , Rmax2 , sum2 , x2 : Longint ; begin if a > b then begin Lmax := 0 ; Rmax := 0 ; sum := 0 ; exit( 0 ); end; if ( L = a ) and ( R = b ) then begin Lmax := tree[ v ].Lmax ; Rmax := tree[ v ].Rmax ; sum := tree[ v ].sum ; exit( tree[ v ].max ); end; m := ( L + R ) >> 1 ; Ls := v << 1 ; Rs := Ls + 1 ; if b <= m then exit( count( Ls , L , m , a , b , Lmax , Rmax , sum ) ); if a > m then exit( count( Rs , m+1 , R , a , b , Lmax , Rmax , sum ) ); x1 := count( Ls , L , m , a , m , Lmax1 , Rmax1 , sum1 ); x2 := count( Rs , m+1 , R , m+1 , b , Lmax2 , Rmax2 , sum2 ); Lmax := maxi( Lmax1 , sum1 + Lmax2 ); Rmax := maxi( Rmax2 , sum2 + Rmax1 ); sum := sum1 + sum2 ; count := maxi( maxi( x1 , x2 ) , Rmax1 + Lmax2 ); end; procedure work; var i , ans : Longint ; x1 , x2 , y1 , y2 : Longint ; Lmax1 , Rmax1 , sum1 : Longint ; Lmax2 , Rmax2 , sum2 : Longint ; LL , RR , SS : Longint ; begin read( n ); build( 1 , 1 , n ); readln; readln( m ); for i := 1 to m do begin readln( x1 , x2 , y1 , y2 ); if x2 <= y1 then begin count( 1 , 1 , n , x1 , x2 , Lmax1 , Rmax1 , sum1 ); count( 1 , 1 , n , y1 , y2 , Lmax2 , Rmax2 , sum2 ); ans := Rmax1 + Lmax2 + s[ y1-1 ] - s[ x2 ] ; end else begin ans := count( 1 , 1 , n , y1 , x2 , LL , RR , SS ); count( 1 , 1 , n , x1 , y1-1 , Lmax1 , Rmax1 , sum1 ); ans := maxi( ans , Rmax1 + LL ); count( 1 , 1 , n , x2+1 , y2 , Lmax2 , Rmax2 , sum2 ); ans := maxi( ans , Lmax2 + RR ); ans := maxi( ans , Rmax1 + Lmax2 + s[ x2 ] - s[ y1-1 ] ); end; writeln( ans ); end; end; begin readln( t ); for t := 1 to t do work; end.

PS: 注意如果x1=y1 那么count( 1 , 1 , n , x1 , y1 - 1 )就会出现error202...

所以45到49行的程序必须加上,否则后果...