[bzoj]2130: 魔塔

这道题我没想出来，只能看题解，学长的题解都指向了Claris的题解。

貌似维护最小值，次大值会跑的更快?不过我没打。

#include <cstdio>
#define C (c=getchar())
using namespace std;
const int N=100005,inf=1<<29;
int n,m,ans;
struct qaq{
	int vl,vr,vx,sig;
}tr[269505];
int k[N],da[N],db[N],dc[N],ga[N],gb[N],gc[N],nb[N],nc[N],f[N];
inline void read(int &a)
{
	int f=1;a=0;
	static char c;
	C;
	while (c<'0'||c>'9') {if (c=='-') f=-1;C;}
	while (c>='0'&&c<='9') a=a*10+c-'0',C;
	a*=f;
}
inline int max(int a,int b){return a>b?a:b;}
inline void update(int k)
{
	tr[k].vl=tr[k<<1].vl;
	tr[k].vr=tr[k<<1|1].vr;
	tr[k].vx=max(tr[k<<1].vx,tr[k<<1|1].vx);
}
void build (int k,int l,int r)
{
	tr[k].sig=-1;
	if (l==r)
	{
		tr[k].vl=tr[k].vr=f[l];
		tr[k].vx=f[l]+gb[l];
		return;
	}
	int mid=(l+r)>>1;
	build(k<<1,l,mid);build(k<<1|1,mid+1,r);
	update(k);
}
void tar(int k,int x,int w)
{
	tr[k].sig=tr[k].vl=tr[k].vr=w;
	tr[k].vx=gb[x]+w;
}
void change(int k,int l,int r,int x,int w)
{
	if (x<=l)
	{
		if (w>=tr[k].vl) return ;
		if (w<tr[k].vr) {tar(k,r,w);return;}
	}
	int mid=(l+r)>>1;
	if (tr[k].sig!=-1) tar(k<<1,mid,tr[k].sig),tar(k<<1|1,r,tr[k].sig),tr[k].sig=-1;
	if (x<=mid) change(k<<1,l,mid,x,w);
	change(k<<1|1,mid+1,r,x,w);
	update(k);
}
inline int work()
{
	register int i,j;
	read(n);
	for (i=1;i<=n;i++) read(k[i]);
	for (i=1;i<=n;i++) read(da[i]);
	for (i=1;i<=n;i++) read(db[i]),nb[db[i]]=i;
	for (i=1;i<=n;i++) read(dc[i]),nc[dc[i]]=i;
	for (i=1;i<=n;i++) read(ga[i]),ga[i]+=ga[i-1];
	for (i=1;i<=n;i++) read(gb[i]),gb[i]+=gb[i-1];
	for (i=1;i<=n;i++) read(gc[i]),gc[i]+=gc[i-1];
	f[0]=gc[n];
	for (i=1;i<=n;i++)
	{
		f[i]=f[i-1];
		if (k[db[i]]==1) if (f[i]>gc[nc[db[i]]-1]) f[i]=gc[nc[db[i]]-1];
	}
	build(1,0,n);
	ans=tr[1].vx;
	for (i=1;i<=n;i++)
	{
		if (k[da[i]]==1) change(1,0,n,nb[da[i]],-inf),change(1,0,n,0,gc[nc[da[i]]-1]);
		else change(1,0,n,nb[da[i]],gc[nc[da[i]]-1]);
		if (ga[i]+tr[1].vx>ans) ans=ga[i]+tr[1].vx;
	}
	return ans;
}
int main()
{
	char ch;
	scanf("%c",&ch);
	read(m);
	while (m--) printf("%d\n",work());
	return 0;
}