传送门
题解
裸裸的线段树o( ̄▽ ̄)ブ
维护:
1. 左端点选择,而右端点不选
2. 右端点选择,而左端点不选
3. 都不选
4. 都选
要开long long!!,,ԾㅂԾ,,
代码
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
struct node
{
long long c[2][2];
node(){memset(c,0,sizeof(c));}
}segtree[161000];
long long n,d;
int main()
{
long long ans = 0;
int m = 1;
scanf("%d%d",&n,&d);
while(m <= n)m <<= 1;m--;
for(int i = m + 1;i <=m + n;i++){
long long x;
scanf("%lld",&x);
segtree[i].c[1][1] = x;
}
for(int i = m;i >= 1;i--){
node ls = node(),rs = node();
ls = segtree[i << 1],rs = segtree[(i << 1) + 1];
segtree[i].c[1][1] = max(ls.c[1][0] + max(rs.c[0][1],rs.c[1][1]),ls.c[1][1] + rs.c[0][1]);
segtree[i].c[0][0] = max(ls.c[0][0] + max(rs.c[0][0],rs.c[1][0]),ls.c[0][1] + rs.c[0][0]);
segtree[i].c[0][1] = max(rs.c[0][1] + max(ls.c[0][1],ls.c[0][0]),rs.c[1][1] + ls.c[0][0]);
segtree[i].c[1][0] = max(ls.c[1][0] + max(rs.c[1][0],rs.c[0][0]),ls.c[1][1] + rs.c[0][0]);
}
for(int i = 1;i <= d;i++){
int x;
long long y;
scanf("%d%lld",&x,&y);
x += m;
segtree[x].c[1][1] = y;
x >>= 1;
while(x > 0){
node ls = node(),rs = node();
ls = segtree[x << 1],rs = segtree[(x << 1) + 1];
segtree[x].c[1][1] = max(ls.c[1][0] + max(rs.c[0][1],rs.c[1][1]),ls.c[1][1] + rs.c[0][1]);
segtree[x].c[0][0] = max(ls.c[0][0] + max(rs.c[0][0],rs.c[1][0]), ls.c[0][1] + rs.c[0][0]);
segtree[x].c[0][1] = max(rs.c[0][1] + max(ls.c[0][1],ls.c[0][0]), rs.c[1][1] + ls.c[0][0]);
segtree[x].c[1][0] = max(ls.c[1][0] + max(rs.c[1][0],rs.c[0][0]), ls.c[1][1] + rs.c[0][0]);
x >>= 1;
}
ans += max(max(segtree[1].c[1][1],segtree[1].c[0][0]),max(segtree[1].c[0][1],segtree[1].c[1][0]));
}
printf("%lld\n",ans);
return 0;
}