2020牛客寒假基础算法训练营1 I dp

#include<bits/stdc++.h>
using namespace std;
const int maxn=3e5+5;
typedef long long ll;
ll n,a,b,c,dp[maxn],maxx;//到i位置分数最大值 
string s;

int main(){
	cin>>n>>a>>b>>c;
	cin>>s;
	
	for(int i=3;i<n;i++){
		dp[i]=dp[i-1];
		if(i-3>=0 && s.substr(i-3,4).compare("nico")==0) dp[i]=max(dp[i],dp[i-4]+a);
		if(i-5>=0 && s.substr(i-5,6).compare("niconi")==0) dp[i]=max(dp[i],dp[i-6]+b);
		if(i-9>=0 && s.substr(i-9,10).compare("niconiconi")==0) dp[i]=max(dp[i],dp[i-10]+c);
	}
	cout<<dp[n-1]<<endl;

	return 0;
}

字符数组下标从1开始

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
 
const int N = 300010;
char s[N]; ll n, a, b, c;
ll f[N];
 
int main()
{
    scanf("%lld%lld%lld%lld", &n, &a, &b, &c);
    scanf("%s", s + 1);
     
    int len = strlen(s + 1);
    for(int i = 4; i <= len; i++){
        f[i] = f[i - 1];
        if(i >= 4) {
            if(s[i - 3] == 'n' && s[i - 2] == 'i' && s[i - 1] == 'c' && s[i] == 'o')
                f[i] = max(f[i], f[i - 4] + a);
        }
        if(i >= 6) {
            if(s[i - 5] == 'n' && s[i - 4] == 'i' && s[i - 3] == 'c' && s[i - 2] == 'o' && s[i - 1] == 'n' && s[i] == 'i')
                f[i] = max(f[i], f[i - 6] + b);
        }
        if(i >= 10) {
            if(s[i - 9] == 'n' && s[i - 8] == 'i' && s[i - 7] == 'c' && s[i - 6] == 'o' && s[i - 5] == 'n' && s[i - 4] == 'i' && s[i - 3] == 'c' && s[i - 2] == 'o' && s[i - 1] == 'n' && s[i] == 'i')
                f[i] = max(f[i], f[i - 10] + c);
        }
    }
     
    printf("%lld\n", f[n]);
     
    return 0;
}