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

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

题解思路

一道并不是很难，也很好理解的dp

代码

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 300005;
string dir[5] = {"nico", "niconi", "niconiconi"};
long long dp[MAXN];
int main()
{
    ios::sync_with_stdio(false);
    int n, a, b, c;
    cin >> n >> a >> b >> c;
    fill(dp, dp + n + 5, 0);
    string s;
    cin.get();
    getline(cin, s);
    for(int i = 1; i <= n; i++){
        if(i >= 4 && s.substr(i - 4, 4) == dir[0]) {
            dp[i] = max(dp[i], dp[i - 4] + a);
//            cout << 1 << " " << i << endl;
        }
        if(i >= 6 && s.substr(i - 6, 6) == dir[1]) {
            dp[i] = max(dp[i], dp[i - 6] + b);
//            cout << 2 << " " << i << endl;
        }
        if(i >= 10 && s.substr(i - 10, 10) == dir[2]) {
            dp[i] = max(dp[i], dp[i - 10] + c);
//            cout << 3 << " " << i << endl;
        }

        dp[i] = max(dp[i], dp[i - 1]);      // i 之前的最高得分
    }
    cout << dp[n] << endl;
    return 0;
}