1550B - Maximum Cost Deletion - CodeForces Solution

/*ahmedkhaled*/
#include<iostream>
#include<string>
#include<iomanip>
#include <algorithm>
#include <math.h>
#include <vector>
#include <stack>
#include <queue>
#include<set>
#include <array>
#define ll long long
#define flash ios::sync_with_stdio(false), cout.tie(NULL), cin.tie(NULL);
using namespace std;
/*void fun(int &a,int &b){
    ll mn=min(a,b);
    a-=mn;
    b-=mn;
}*/
void go(){
    int n,a,b;
    cin>>n>>a>>b;
    string s;cin>>s;
    if(b>=0){
        cout<<n*(a+b)<<'\n';
    }else {
        int sum=1;
        for(int i=0;i+1<n;i++){
          if((s[i]!=s[i+1]))
                ++sum;

        }
    cout<<a*n+b*(sum/2+1)<<'\n';
    }
}



int main() {
   int t;cin>>t;
   while(t--){
       go();
   }
}