#include<iostream>
#include<string>
using namespace std;
int main()
{
int N,js,sum,n, a, b;
string str;
cin >> N;
while (N--)
{
js=1;
cin >> n >> a >> b ;
cin >> str;
for (int i = 0; i < str.size() - 1; i++)
if (str[i] != str[i + 1])
++js;
sum=max(b * n, b * (js / 2 + 1));
sum+=a*n;
cout << sum << endl;
}
return 0;
}
B - Maximum Cost Deletion
最新推荐文章于 2021-08-05 09:43:14 发布