牛客寒假集训营nico和niconiconi 简单dp

题目传送门

---

简单动态规划，可惜刚刚补题的时候没注意细节问题，还是搞了很久。

ll dp[301000];
int main()
{
       string str;
       int n, a, b, c;
       cin >> n >> a >> b >> c >> str;
       str = ' ' + str;
       for (int i = 1; i <= n; i++)
       {
              dp[i] = dp[i - 1];
              if (i - 3 >= 1 && str[i - 3] == 'n' && str[i - 2] == 'i' && str[i - 1] == 'c' && str[i] == 'o')
                     dp[i] = max(dp[i - 4] + a, dp[i]);
              if (i - 5 >= 1 && str[i - 5] == 'n' && str[i - 4] == 'i' && str[i - 3] == 'c' && str[i - 2] == 'o' && str[i - 1] == 'n' && str[i] == 'i')
                     dp[i] = max(dp[i - 6] + b, dp[i]);
              if (i - 9 >= 1 && str[i - 9] == 'n' && str[i - 8] == 'i' && str[i - 7] == 'c' && str[i - 6] == 'o' && str[i - 5] == 'n' && str[i - 4] == 'i' && str[i - 3] == 'c' && str[i - 2] == 'o' && str[i - 1] == 'n' && str[i] == 'i')
                     dp[i] = max(dp[i - 10] + c, dp[i]);
       }
       cout << dp[n] << endl;
       return 0;
}