GSS1&GSS3

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

SPOJ Problem Set (classical) 1043. Can you answer these queries I Problem code: GSS1

 

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-2s
Source limit:	5000B
Languages:	All except: ERL JS PERL 6

---

经典线段树

题意：给定一个静态序列 求[a,b]之间的最大子串和...

每个节点维护sum(区间总和) , max(最大和子串) , Lmax(从左端点开始的最大子串和) , Rmax(从左端点开始的最大子串和)四个域

      tree[ v ].sum := tree[ Ls ].sum + tree[ Rs ].sum ;
      tree[ v ].Lmax := max( tree[ Ls ].Lmax , tree[ Ls ].sum + tree[ Rs ].Lmax );
      tree[ v ].Rmax := max( tree[ Rs ].Rmax , tree[ Rs ].sum + tree[ Ls ].Rmax );
      tree[ v ].max := max( max( tree[ Ls ].max , tree[ Rs ].max ) , tree[ Ls ].Rmax + tree[ Rs ].Lmax );

 

{ SPOJ submission 4602919 (PAS fpc) plaintext list. Status: AC, problem GSS1, contest SPOJ. By hccz95 (HC), 2011-01-20 08:35:49. } const maxn = 50000 ; var t , ss , sl , sr : array[ 0..maxn shl 2 ] of Longint ; n , m : Longint ; function max( 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 read( t[ v ] ); ss[ v ] := t[ v ] ; sl[ v ] := t[ v ] ; sr[ v ] := t[ v ] ; exit; end; m := ( L + R ) >> 1 ; ls := v << 1 ; rs := ls + 1 ; build( ls , L , m ); build( rs , m + 1 , R ); t[ v ] := max( max( t[ ls ] , t[ rs ] ) , sr[ ls ] + sl[ rs ] ); ss[ v ] := ss[ ls ] + ss[ rs ] ; sl[ v ] := max( sl[ ls ] , ss[ ls ] + sl[ rs ] ); sr[ v ] := max( sr[ rs ] , ss[ rs ] + sr[ ls ] ); end; function count( v , L , R , a , b : Longint ; var e , p , q : Longint ) : Longint ; var m , ls , rs : Longint ; o1 , o2 : Longint ; e1 , p1 , q1 : Longint ; e2 , p2 , q2 : Longint ; begin if ( L = a ) and ( R = b ) then begin e := ss[ v ] ; p := sl[ v ] ; q := sr[ v ] ; exit( t[ v ] ); end; m := ( L + R ) >> 1 ; ls := v << 1 ; rs := ls + 1 ; if b <= m then exit( count( ls , L , m , a , b , e , p , q ) ); if a > m then exit( count( rs , m + 1 , R , a , b , e , p , q ) ); begin o1 := count( ls , L , m , a , m , e1 , p1 , q1 ); o2 := count( rs , m + 1 , R , m + 1 , b , e2 , p2 , q2 ); e := e1 + e2 ; p := max( p1 , e1 + p2 ); q := max( q2 , e2 + q1 ); exit( max( max( o1 , o2 ) , q1 + p2 ) ); end; end; procedure main; var i , a , b : Longint ; e , p , q : Longint ; begin readln( n ); build( 1 , 1 , n ); readln( m ); for i := 1 to m do begin readln( a , b ); writeln( count( 1 , 1 , n , a , b , e , p , q ) ); end; end; begin main; end.

 

 

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

SPOJ Problem Set (classical) 1716. Can you answer these queries III Problem code: GSS3

 

You are given a sequence A of N (N <= 50000) integers between -10000 and 10000. On this sequence you have to apply M (M <= 50000) operations:
modify the i-th element in the sequence or for given x y print max{Ai + Ai+1 + .. + Aj | x<=i<=j<=y }.

Input

The first line of input contains an integer N. The following line contains N integers, representing the sequence A1..AN.
The third line contains an integer M. The next M lines contain the operations in following form:
0 x y: modify Ax into y (|y|<=10000).
1 x y: print max{Ai + Ai+1 + .. + Aj | x<=i<=j<=y }.

Output

For each query, print an integer as the problem required.

Example

Input:
4
1 2 3 4
4
1 1 3
0 3 -3
1 2 4
1 3 3

Output:
6
4
-3

---

Added by:	Jin Bin
Date:	2007-08-03
Time limit:	1s
Source limit:	5000B
Languages:	All except: C99 strict ERL JS PERL 6
Resource:	own problem

 

 

 

 

 

 

 

 

---

 

只比GSS1多一个改值操作 其它地方一样...

 

{ SPOJ submission 4605973 (PAS fpc) plaintext list. Status: AC, problem GSS3, contest SPOJ. By hccz95 (HC), 2011-01-21 04:33:25. } const maxn = 50000 ; var n , m : Longint ; sa , ss , sl , sr : array[ 0..maxn shl 2 ] of Longint ; function max( a , b : Longint ) : Longint ; begin if a > b then exit( a ) else exit( b ); end; procedure insert( v , L , R , i , x : Longint ); var m , Ls , Rs : Longint ; begin if L = R then begin sa[ v ] := x ; ss[ v ] := x ; sl[ v ] := x ; sr[ v ] := x ; exit; end; m := ( L + R ) >> 1 ; Ls := v << 1 ; Rs := Ls + 1 ; if i <= m then insert( Ls , L , m , i , x ) else insert( Rs , m + 1 , R , i , x ); sa[ v ] := max( max( sa[ Ls ] , sa[ Rs ] ) , sl[ Rs ] + sr[ Ls ] ); ss[ v ] := ss[ Ls ] + ss[ Rs ] ; sl[ v ] := max( sl[ Ls ] , ss[ Ls ] + sl[ Rs ] ); sr[ v ] := max( sr[ Rs ] , ss[ Rs ] + sr[ Ls ] ); end; function count( v , L , R , a , b : Longint ; var e , p , q : Longint ) : Longint ; var m , Ls , Rs : Longint ; e1 , p1 , q1 : Longint ; e2 , p2 , q2 : Longint ; o1 , o2 : Longint ; begin if ( L = a ) and ( R = b ) then begin e := ss[ v ] ; p := sl[ v ] ; q := sr[ v ] ; exit( sa[ v ] ); end; m := ( L + R ) >> 1 ; Ls := v << 1 ; Rs := Ls + 1 ; if b <= m then exit( count( Ls , L , m , a , b , e , p , q ) ); if a > m then exit( count( Rs , m + 1 , R , a , b , e , p , q ) ); o1 := count( Ls , L , m , a , m , e1 , p1 , q1 ); o2 := count( Rs , m + 1 , R , m + 1 , b , e2 , p2 , q2 ); e := e1 + e2 ; p := max( p1 , e1 + p2 ); q := max( q2 , e2 + q1 ); exit( max( max( o1 , o2 ) , q1 + p2 ) ); end; procedure main; var i , a , b , x : Longint ; e , p , q : Longint ; begin readln( n ); for i := 1 to n do begin read( x ); insert( 1 , 1 , n , i , x ); end; readln( m ); for i := 1 to m do begin readln( x , a , b ); if x = 0 then insert( 1 , 1 , n , a , b ) else writeln( count( 1 , 1 , n , a , b , e , p , q ) ); end; end; begin main; end.