题解 | nico和niconiconi

#include <iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n,a,b,c;
    cin>>n>>a>>b>>c;
    string s;
    cin>>s;
    vector<long long>dp(n+1,0);
    for(int i=1;i<=n;i++){
        dp[i]=dp[i-1];
        if(i>=4&&s[i-4]=='n'&&s[i-3]=='i'&&s[i-2]=='c'&&s[i-1]=='o'){
            dp[i]=max(dp[i],dp[i-4]+a);
        }
        if(i>=6&&s[i-6]=='n'&&s[i-5]=='i'&&s[i-4]=='c'&&s[i-3]=='o'&&s[i-2]=='n'&&s[i-1]=='i'){
            dp[i]=max(dp[i],dp[i-6]+b);
        }
        if(i>=10&&s[i-10]=='n'&&s[i-9]=='i'&&s[i-8]=='c'&&s[i-7]=='o'&&s[i-6]=='n'&&s[i-5]=='i'&&s[i-4]=='c'&&s[i-3]=='o'&&s[i-2]=='n'&&s[i-1]=='i'){
            dp[i]=max(dp[i],dp[i-10]+c);
        }
    }
    cout<<*max_element(dp.begin(),dp.end())<<endl;
    return 0;
}
// 64 位输出请用 printf("%lld")