Submission #1403315

---

Source Code Expand

import java.util.*;

public class Main {
	static int N;
	static String S;
	static int[] count;
	static int ret;
	//static int ret1,ret2=-1;
/*	static int dfs(int x){
		int ret1=Math.min(count[x-3], count[x-2]);
		int ret2=Math.min(ret1,count[x-1]);
		if(S.charAt(x)=='x') return ret2+1;
		else return ret2;
	}
*/
	public static void main(String args[]){
		Scanner s=new Scanner(System.in);
		N=s.nextInt();
		S=s.next();
		count=new int[N];
		for(int i=0;i<N;i++){
			count[i]=0;
		
		if(i==1) {
				if(S.charAt(i)=='X') count[i]++;
			}
			if(i>=2){
				ret=N;
				//System.out.println(ret);
				ret=Math.min(count[i-1], count[i-2]);
				//System.out.println(ret);
				if(i>=3){
				ret=Math.min(ret,count[i-3]);
				//System.out.println(ret);
				}
				count[i]=ret;
				if(S.charAt(i)=='X') count[i]++;;
			}
			//System.out.println("count["+i+"]"+count[i]);
		}
		System.out.println(count[N-1]);
	}
}

Submission Info

Judge Result