nico和niconiconi

原题地址：https://ac.nowcoder.com/acm/contest/3002/I

解题思路
一道中规中矩的动态规划，定义一个dp数组，储存每一个字母下的最大分数，最后输出dp[n]

AC代码

#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 300000 + 10;
char str[maxn];
typedef long long ll;
ll dp[maxn];

string substring(int a, int b)
{
    string res;
    for (int i = a; i <= b; i++)
    {
        res += str[i];
    }
    return res;
}

ll me_max(ll a,ll b)
{
    if(a>b) return a;
    else return b;
}

int main()
{//动态规划
    int n, a, b, c;
    scanf("%d%d%d%d%s", &n, &a, &b, &c, str + 1);
    dp[0] = 0;
    for (int i = 1; i <= n; i++)
    {
        dp[i] = dp[i - 1];
        if (i >= 4 && substring(i - 3, i) == "nico")
        {
            ll x = dp[i - 4] + a;
            dp[i] = me_max(x, dp[i]);
        }
        if (i >= 6 && substring(i - 5, i) == "niconi")
        {
            ll x = dp[i - 6] + b;
            dp[i] = me_max(x, dp[i]);
        }
        if (i >= 10 && substring(i - 9, i) == "niconiconi")
        {
            ll x = dp[i - 10] + c;
            dp[i] = me_max(x, dp[i]);
        }
    }
    cout<<dp[n];
    return 0;
}