Submission #1417500

---

Source Code Expand

import java.util.*;
public class Main{
	static int n=3;
	static int[] memo=new int[100];
	static String road;
	public static void main(String[] argc){
		Scanner sc= new Scanner(System.in);
		n=sc.nextInt();
		road=sc.next();
		for(int i=0;i<100;i++) memo[i]=-1;
		System.out.println(dp(1));
	}
 
	public static int dp(int k){
		if(k>=n) return 0;
		else{
			if(memo[k-1]!=-1) return memo[k-1];
			else {
				memo[k-1]=Math.min(dp(k+1)+pond(k), Math.min(dp(k+2)+pond(k), dp(k+3)+pond(k)));
				return memo[k-1];
			}
		}
	}
 
	public static int pond(int k){
		if(k>road.length()) return 0;
		else if(road.charAt(k-1)=='X') return 1;
		else return 0;
	}
}

Submission Info

Judge Result