Submission #1269617

---

Source Code Expand

#include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>

using namespace std;
typedef long long ll;
typedef pair<int, int> Pr;

int N;
string s;

int dp[110];

int dfs(int k) {
	if (k >= N - 1)return 0;
	if (dp[k] != -1)return dp[k];
	int ret = 99999999;
	int temp = 0;
	if (s[k] == 'X')temp = 1;
	for (int i = 1; i <= 3; i++)
		ret = min(ret, dfs(k + i) + temp);
	return dp[k] = ret;
}

int main()
{
	cin >> N >> s;
	for (int i = 0; i < N; i++)
		dp[i] = -1;

	cout << dfs(0) << endl;
	return 0;
}

Submission Info

Judge Result