资深用户力荐：山海鲸可视化五大常用图表解析

一开始没看到不能重复移动 然后写了一个假的从后往前的反悔贪心

其实是一个线性DP

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
#define int long long
const int N = 2e5+10;
const int inf = 0x3f3f3f3f;
const int mod = 1e9+7;
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int lcm(int a,int b){return a*b/gcd(a,b);}
int qmi(int a,int b,int mod){int res=1;while(b){if(b&1)res=res*a%mod;b>>=1;a=a*a%mod;}return res;}


int n,q,m;

// int e[N],ne[N],w[N],h[N],idx;
// void add(int a,int b,int c){
	// e[idx] = b,ne[idx] = h[a],w[idx] = c,h[a] = idx++;
// }

char s[N];
int w[N];
int dp[N][2];
void solve()
{
	cin>>n;
	for(int i=1;i<=n;i++)cin>>s[i];
	for(int i=1;i<=n;i++)cin>>w[i];
	for(int i=0;i<=n;i++)dp[i][0] = dp[i][1] = 0;

	
	
	for(int i=1;i<=n;i++){
		if(s[i]=='0')dp[i][0] = max(dp[i-1][0],dp[i-1][1]);
		else
		{   dp[i][0] = max(dp[i-1][0],dp[i-1][1])+w[i];
			dp[i][1] = max(dp[i][1],dp[i-1][s[i-1]-'0']+w[i-1]);
		}
	}
	
	cout<<max(dp[n][0],dp[n][1])<<"\n";
	
	
	

}

signed main()
{
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int _;
	cin>>_;
	//_ = 1;
	while(_--)solve();
	return 0;
}