codeforces1476C. Longest Simple Cycle

https://codeforces.com/contest/1476/problem/C

这题维护一个前缀可以继承的最大环就行了

每次now=max(b[i]-a[i],a[i]-1+c[i-1]-b[i]+now)

就是说要么抛弃前面的，又b[i]-a[i]组成左边，要么向上下跑继承前面的

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

const int maxl=3e5+10;

int n,m,k,tot,cnt;ll ans;
int a[maxl],b[maxl],c[maxl];
char s[maxl];
bool vis[maxl];

inline void prework()
{
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
		scanf("%d",&c[i]);
	
	for(int i=1;i<=n;i++)
		scanf("%d",&a[i]);
	for(int i=1;i<=n;i++)
		scanf("%d",&b[i]);
}

inline void mainwork()
{
	ll now=0;ans=0;
	for(int i=2;i<=n;i++)
	{
		if(a[i]>b[i])
			swap(a[i],b[i]);
		if(a[i]==b[i])
			now=2;
		else
		{
			if(i-1>1 && now+a[i]-1+c[i-1]-b[i]>b[i]-a[i])
				now+=a[i]-1+c[i-1]-b[i]+2;
			else
				now=b[i]-a[i]+2;
		}
		ans=max(c[i]-1+now,ans);
		
	}
}

inline void print()
{
	printf("%lld\n",ans);
}

int main()
{
	int t=1;
	scanf("%d",&t);
	while(t--)
	{
		prework();
		mainwork();
		print();
	}
	return 0;
}