nico和niconiconi题解

原题链接：https://ac.nowcoder.com/acm/contest/3002/I

思路

---

一开始想用贪心做，wa了一万次，后来发现dp才是正解

代码

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
#define ll long long
using namespace std;
ll n, a, b, c;
char str[300001];//一大坑点在于必须要保留str[0]的位置，从str[1]开始输入字符串，否则会访问str[-1]，因此不能直接用string及其函数，就很蛋疼
ll dp[300001];
int main()
{
	cin >> n >> a >> b >> c;
	scanf("%s", str + 1);
	for (int i = 1; i <= n; i++)
	{
		dp[i] = dp[i - 1];
		if (i >= 4 && str[i - 3] == 'n' && str[i - 2] == 'i' && str[i - 1] == 'c' && str[i] == 'o')
			dp[i] = max(dp[i], dp[i - 4] + a);
		if (i >= 6 && 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], dp[i - 6] + b);
		if (i >= 10 && 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], dp[i - 10] + c);
	}
	printf("%lld\n", dp[n]);
	return 0;
}