题目文章来源:https://uudwc.com/A/EBP11
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e5+9;
int a[N];
int n;
string s;
int dp[N][2];
map<int,int> mp;
signed main(){
ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
cin>>n;
for(int i=0;i<n;i++)cin>>a[i];
cin>>s;
for(int i=1;i<n;i++){
dp[i][0]=max(dp[i-1][0],dp[i-1][1]);
if(s[i]!=s[i-1])dp[i][1]=max(dp[i-1][1],dp[i-1][0]+a[i]+a[i-1]);
}
cout<<max(dp[n-1][0],dp[n-1][1]);
return 0;
}
文章来源地址https://uudwc.com/A/EBP11