[CF1096D] DP

最新推荐文章于 2021-09-10 20:04:52 发布

ShɑΙteж

最新推荐文章于 2021-09-10 20:04:52 发布

阅读量381

点赞数 1

CC 4.0 BY-SA版权

分类专栏：动态规划

本文链接：https://blog.youkuaiyun.com/strangeDDDF/article/details/86529878

动态规划专栏收录该内容

22 篇文章

订阅专栏

[CF1096D Easy Problem]

Code

#include<bits/stdc++.h>
#define rep(i,a,b) for(ll i=(a);i<=(b);i++)
#define ll long long
using namespace std;
const ll N=1e5+100;
ll f[N][10],a[N],n;
char ch[N];
string s="hard";
int main()
{
    scanf("%lld",&n);
    scanf("%s",ch+1);
    rep(i,1,n)scanf("%d",&a[i]);
    memset(f,0x3f,sizeof(f));
    rep(i,1,4)f[0][i]=0;
    rep(i,1,n){
        rep(j,1,4){
            if(ch[i]==s[j-1])f[i][j]=min(f[i-1][j-1],f[i-1][j]+a[i]);
            else f[i][j]=min(f[i][j],f[i-1][j]);
        }
    }
    cout<<min(min(f[n][4],f[n][1]),min(f[n][2],f[n][3]));
    return 0;
}