-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathGSS3.cpp
147 lines (134 loc) · 3.09 KB
/
GSS3.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
#include<iostream>
#include<stdio.h>
using namespace std;
struct node
{
int max_sum;
int l_range;
int r_range;
int cum_sum;
int end_sum;
int start_sum;
struct node *left;
struct node *right;
};
typedef struct node node;
int max(int a, int b)
{
if(a>=b)
return a;
else
return b;
}
int max(int a,int b, int c)
{
if(a>=b &&a>=c)
return a;
else if(b>=a&&b>=c)
return b;
return c;
}
node modify(node tree[], int i, int idx, int val)
{
if(tree[i].l_range==tree[i].r_range)
{
tree[i].max_sum=val;
tree[i].end_sum=val;
tree[i].cum_sum=val;
tree[i].start_sum=val;
return tree[i];
}
else
{
int mid=(tree[i].l_range+tree[i].r_range)/2;
if(idx<=mid)
{
node x=modify(tree,2*i,idx,val);
tree[i].max_sum=max(x.max_sum,tree[2*i+1].max_sum,x.end_sum+tree[2*i+1].start_sum);
tree[i].start_sum=max(x.start_sum,x.cum_sum+tree[2*i+1].start_sum);
tree[i].end_sum=max(tree[2*i+1].end_sum,x.end_sum+tree[2*i+1].cum_sum);
tree[i].cum_sum=x.cum_sum+tree[2*i+1].cum_sum;
return tree[i];
}
if(idx>=mid+1)
{
node x=modify(tree,2*i+1,idx,val);
tree[i].max_sum=max(x.max_sum,tree[2*i].max_sum,tree[2*i].end_sum+x.start_sum);
tree[i].start_sum=max(tree[2*i].start_sum,tree[2*i].cum_sum+x.start_sum);
tree[i].end_sum=max(x.end_sum,x.cum_sum+tree[2*i].end_sum);
tree[i].cum_sum=x.cum_sum+tree[2*i].cum_sum;
return tree[i];
}
}
}
node buildTree(int s[], int start, int end,int i, node tree[])
{
if(start==end)
{
tree[i].max_sum=s[start];
tree[i].l_range=start;
tree[i].r_range=end;
tree[i].end_sum=s[start];
tree[i].cum_sum=s[start];
tree[i].start_sum=s[start];
return tree[i];
}
else
{
int mid=(start+end)/2;
tree[2*i]=buildTree(s,start,mid,2*i,tree);
tree[2*i+1]=buildTree(s,mid+1,end,2*i+1,tree);
tree[i].l_range=start;
tree[i].r_range=end;
tree[i].max_sum=max(tree[2*i].max_sum,tree[2*i+1].max_sum,tree[2*i].end_sum+tree[2*i+1].start_sum);
tree[i].start_sum=max(tree[2*i].start_sum,tree[2*i].cum_sum+tree[2*i+1].start_sum);
tree[i].end_sum=max(tree[2*i+1].end_sum,tree[2*i].end_sum+tree[2*i+1].cum_sum);
tree[i].cum_sum=tree[2*i].cum_sum+tree[2*i+1].cum_sum;
return tree[i];
}
}
node query(node tree[], int i, int start, int end)
{
if(tree[i].l_range>=start && tree[i].r_range<=end)
return tree[i];
else
{
int mid=(tree[i].l_range+tree[i].r_range)/2;
if(end<=mid)
return query(tree,2*i,start,end);
if(start>=(mid+1))
return query(tree,2*i+1,start,end);
else
{
node x;
node a=query(tree,2*i,start,end);
node b=query(tree,2*i+1,start,end);
x.max_sum=max(a.max_sum,b.max_sum,a.end_sum+b.start_sum);
x.start_sum=max(a.start_sum,a.cum_sum+b.start_sum);
x.end_sum=max(b.end_sum,a.end_sum+b.cum_sum);
x.cum_sum=a.cum_sum+b.cum_sum;
return x;
}
}
}
int main()
{
int n;
scanf("%d",&n);
int s[n+1];
node tree[4*n+1];
for(int i=1;i<=n;i++)
scanf("%d",&s[i]);
node root=buildTree(s,1,n,1,tree);
int m,x,y,c;
scanf("%d",&m);
for(int i=0;i<m;i++)
{
scanf(" %d %d %d",&c,&x,&y);
if(c==1)
printf("%d\n",query(tree,1,x,y).max_sum);
else
modify(tree,1,x,y);
}
return 0;
}