2020牛客寒假算法基础集训营1 I - nico和niconiconi （DP）

是个很好想的DP，QAQ，如果自己能往DP那方面想想的话

#define int ll
int dp[MAXN];
char s[MAXN];
signed main()
{
    int n,a,b,c;cin>>n>>a>>b>>c;
    scanf("%s",s+1);
    for(int i = 4;i<=n;++i)
    {
        dp[i]=max(dp[i],dp[i-1]);
        if(s[i]=='o'&&s[i-1]=='c'&&s[i-2]=='i'&&s[i-3]=='n') 
            dp[i]=max(dp[i],dp[i-4]+a);
        if(i>=6&&s[i]=='i'&&s[i-1]=='n'&&s[i-2]=='o'&&s[i-3]=='c'&&s[i-4]=='i'&&s[i-5]=='n')
            dp[i]=max(dp[i],dp[i-6]+b);
        if(i>=10&&s[i]=='i'&&s[i-1]=='n'&&s[i-2]=='o'&&s[i-3]=='c'&&s[i-4]=='i'&&s[i-5]=='n'&&s[i-6]=='o'&&s[i-7]=='c'&&s[i-8]=='i'&&s[i-9]=='n')
            dp[i]=max(dp[i],dp[i-10]+c);
    }
    cout<<dp[n]<<endl;
    return 0;
}