Easy Problem（动态规划）

Vasya is preparing a contest, and now he has written a statement for an easy problem. The statement is a string of length $$$n$$$ consisting of lowercase Latin latters. Vasya thinks that the statement can be considered hard if it contains a subsequence hard; otherwise the statement is easy. For example, hard, hzazrzd, haaaaard can be considered hard statements, while har, hart and drah are easy statements.

Vasya doesn’t want the statement to be hard. He may remove some characters from the statement in order to make it easy. But, of course, some parts of the statement can be crucial to understanding. Initially the ambiguity of the statement is $$$0$$$, and removing $$$i$$$-th character increases the ambiguity by $$$a_i$$$ (the index of each character is considered as it was in the original statement, so, for example, if you delete character r from hard, and then character d, the index of d is still $$$4$$$ even though you delete it from the string had).

Vasya wants to calculate the minimum ambiguity of the statement, if he removes some characters (possibly zero) so that the statement is easy. Help him to do it!

Recall that subsequence is a sequence that can be derived from another sequence by deleting some elements without changing the order of the remaining elements.

Input
The first line contains one integer $$$n$$$ ($$$1\le n\le 10^5$$$) — the length of the statement.

The second line contains one string $$$s$$$ of length $$$n$$$, consisting of lowercase Latin letters — the statement written by Vasya.

The third line contains $$$n$$$ integers $$$a_1,a_2,\dots ,a_n$$$ ($$$1\le a_i\le 998244353$$$).

Output
Print minimum possible ambiguity of the statement after Vasya deletes some (possibly zero) characters so the resulting statement is easy.

Examples
Input
6
hhardh
3 2 9 11 7 1
Output
5
Input
8
hhzarwde
3 2 6 9 4 8 7 1
Output
4
Input
6
hhaarr
1 2 3 4 5 6
Output
0
Note
In the first example, first two characters are removed so the result is ardh.

In the second example, $$$5$$$-th character is removed so the result is hhzawde.

In the third example there’s no need to remove anything.
题意很简单，就是删除字符，使之没有hard子序列。问最小的花费是多少。
这种题目就是看删除前面字符对于后面的影响。dp[0~3]分别代表着删除h到d的最小花费。举个例子，就像hhard这种的，遇见a的时候，我们会想是单纯的删除a价值小，还是删除两个h价值小。这样就有了递推公式：dp[i]=min(dp[i-1],dp[i]+a[i])。
代码如下：

#include<bits/stdc++.h>
#define ll long long
#define inf 0x7f7f7f7f
using namespace std;

const int maxx=1e6+100;
ll dp[10];
ll a[maxx];
string s;
int n;

int main()
{
	while(~scanf("%d",&n))
	{
		cin>>s;
		for(int i=0;i<n;i++) scanf("%lld",&a[i]);
		memset(dp,0,sizeof(dp)); 
		for(int i=0;i<n;i++)
		{
			if(s[i]=='h') dp[0]+=a[i];
			else if(s[i]=='a') dp[1]=min(dp[0],dp[1]+a[i]);
			else if(s[i]=='r') dp[2]=min(dp[1],dp[2]+a[i]);
			else if(s[i]=='d') dp[3]=min(dp[2],dp[3]+a[i]); 
		}
		printf("%lld\n",dp[3]);
	}
}

dp一定多想想，有时候没有看起来那么难！
努力加油a啊，(^o)/~