Submission #3385323

---

Source Code Expand

#include<bits/stdc++.h>
#define int long long
using namespace std;
string p;
string bin;
int n;
int a[10010];
int dp[10010];
inline void xzyopr()
{
	cin>>n;
	cin>>p;
	for(int i=1;i<=n;i++)
	{
		dp[i]=19260817;
	}
	for(int i=0;i<n;i++)
	{
		if(p[i]=='.')a[i+1]=0;
		if(p[i]=='X')a[i+1]=1;
	}
	dp[2]=a[2];dp[3]=a[3];dp[4]=a[4];
	for(int i=5;i<=n;i++)
	{
		for(int j=i-3;j<i;j++)
		{
			dp[i]=min(dp[i],dp[j]+a[i]);
		}
	}
	cout<<dp[n]<<endl;
}
signed main()
{
	xzyopr();
	
	return 0;
}

Submission Info

Judge Result